YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:35:54,570 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:35:54,572 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:35:54,583 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:35:54,583 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:35:54,584 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:35:54,585 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:35:54,587 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:35:54,589 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:35:54,589 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:35:54,590 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:35:54,590 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:35:54,591 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:35:54,592 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:35:54,593 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:35:54,594 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:35:54,595 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:35:54,596 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:35:54,598 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:35:54,599 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:35:54,600 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:35:54,602 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:35:54,604 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:35:54,604 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:35:54,604 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:35:54,605 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:35:54,605 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:35:54,606 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:35:54,606 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:35:54,607 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:35:54,607 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:35:54,608 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:35:54,609 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:35:54,609 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:35:54,610 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:35:54,610 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:35:54,610 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:35:54,611 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:35:54,612 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:35:54,612 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 10:35:54,626 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:35:54,626 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:35:54,627 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:35:54,627 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:35:54,628 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:35:54,628 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:35:54,628 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:35:54,628 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:35:54,628 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:35:54,628 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:35:54,629 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:35:54,629 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:35:54,629 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:35:54,629 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:35:54,629 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:35:54,629 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:35:54,630 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:35:54,630 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:35:54,630 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:35:54,630 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:35:54,630 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:35:54,630 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:35:54,631 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:35:54,631 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:35:54,631 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:35:54,631 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:35:54,631 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:35:54,631 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:35:54,632 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:35:54,657 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:35:54,670 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:35:54,674 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:35:54,675 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:35:54,675 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:35:54,676 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:35:54,738 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/a5c5e71d0c504e47a2f5803a116e76a5/FLAG534efaec3 [2020-06-22 10:35:55,078 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:35:55,078 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:35:55,079 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:35:55,085 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/a5c5e71d0c504e47a2f5803a116e76a5/FLAG534efaec3 [2020-06-22 10:35:55,471 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/a5c5e71d0c504e47a2f5803a116e76a5 [2020-06-22 10:35:55,483 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:35:55,484 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:35:55,486 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:35:55,486 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:35:55,489 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:35:55,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:35:55" (1/1) ... [2020-06-22 10:35:55,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6755c0cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:35:55, skipping insertion in model container [2020-06-22 10:35:55,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:35:55" (1/1) ... [2020-06-22 10:35:55,502 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:35:55,520 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:35:55,691 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:35:55,764 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:35:55,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:35:55,799 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:35:55,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:35:55 WrapperNode [2020-06-22 10:35:55,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:35:55,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:35:55,801 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:35:55,801 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:35:55,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:35:55" (1/1) ... [2020-06-22 10:35:55,819 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:35:55" (1/1) ... [2020-06-22 10:35:55,842 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:35:55,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:35:55,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:35:55,842 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:35:55,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:35:55" (1/1) ... [2020-06-22 10:35:55,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:35:55" (1/1) ... [2020-06-22 10:35:55,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:35:55" (1/1) ... [2020-06-22 10:35:55,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:35:55" (1/1) ... [2020-06-22 10:35:55,860 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:35:55" (1/1) ... [2020-06-22 10:35:55,864 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:35:55" (1/1) ... [2020-06-22 10:35:55,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:35:55" (1/1) ... [2020-06-22 10:35:55,867 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:35:55,868 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:35:55,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:35:55,868 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:35:55,869 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:35:55" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:35:55,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 10:35:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:35:55,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:35:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:35:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:35:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:35:56,162 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:35:56,162 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2020-06-22 10:35:56,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:35:56 BoogieIcfgContainer [2020-06-22 10:35:56,164 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:35:56,164 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:35:56,164 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:35:56,166 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:35:56,168 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:35:56" (1/1) ... [2020-06-22 10:35:56,183 INFO L313 BlockEncoder]: Initial Icfg 27 locations, 33 edges [2020-06-22 10:35:56,185 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:35:56,186 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:35:56,186 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:35:56,187 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:35:56,188 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:35:56,189 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:35:56,189 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:35:56,226 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:35:56,344 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 22736 conjuctions. This might take some time... [2020-06-22 10:37:09,126 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 22736 conjuctions. [2020-06-22 10:37:09,490 INFO L200 BlockEncoder]: SBE split 10 edges [2020-06-22 10:37:09,502 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-06-22 10:37:09,506 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:37:09,575 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding [2020-06-22 10:37:09,577 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states [2020-06-22 10:37:09,583 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:37:09,584 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:37:09,585 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:37:09,586 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:37:09,592 INFO L313 BlockEncoder]: Encoded RCFG 17 locations, 1401 edges [2020-06-22 10:37:09,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:37:09 BasicIcfg [2020-06-22 10:37:09,593 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:37:09,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:37:09,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:37:09,598 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:37:09,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:35:55" (1/4) ... [2020-06-22 10:37:09,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f03d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:37:09, skipping insertion in model container [2020-06-22 10:37:09,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:35:55" (2/4) ... [2020-06-22 10:37:09,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f03d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:37:09, skipping insertion in model container [2020-06-22 10:37:09,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:35:56" (3/4) ... [2020-06-22 10:37:09,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f03d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:37:09, skipping insertion in model container [2020-06-22 10:37:09,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:37:09" (4/4) ... [2020-06-22 10:37:09,602 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:37:09,613 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:37:09,622 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-06-22 10:37:09,641 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-06-22 10:37:09,674 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:37:09,675 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:37:09,675 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:37:09,675 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:37:09,676 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:37:09,676 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:37:09,676 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:37:09,676 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:37:09,677 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:37:09,697 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2020-06-22 10:37:09,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 10:37:09,709 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:37:09,710 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:37:09,710 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:37:09,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:09,716 INFO L82 PathProgramCache]: Analyzing trace with hash -256984068, now seen corresponding path program 1 times [2020-06-22 10:37:09,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:09,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:09,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:09,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:09,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:09,812 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:09,812 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:09,812 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:09,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:09,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 10:37:09,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:09,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:37:09,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:37:09,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:37:09,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:37:09,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:37:09,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:37:09,959 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2020-06-22 10:37:12,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:37:12,027 INFO L93 Difference]: Finished difference Result 28 states and 2776 transitions. [2020-06-22 10:37:12,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:37:12,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-06-22 10:37:12,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:37:12,043 INFO L225 Difference]: With dead ends: 28 [2020-06-22 10:37:12,043 INFO L226 Difference]: Without dead ends: 17 [2020-06-22 10:37:12,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:37:12,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-06-22 10:37:12,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-06-22 10:37:12,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 10:37:12,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 72 transitions. [2020-06-22 10:37:12,086 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 72 transitions. Word has length 8 [2020-06-22 10:37:12,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:37:12,087 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 72 transitions. [2020-06-22 10:37:12,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:37:12,087 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 72 transitions. [2020-06-22 10:37:12,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 10:37:12,088 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:37:12,088 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:37:12,088 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:37:12,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:12,088 INFO L82 PathProgramCache]: Analyzing trace with hash -256983107, now seen corresponding path program 1 times [2020-06-22 10:37:12,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:12,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:12,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:12,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:12,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:12,094 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:12,095 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:12,095 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:12,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:12,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 10:37:12,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:12,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:37:12,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:37:12,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:37:12,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:37:12,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:37:12,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:37:12,158 INFO L87 Difference]: Start difference. First operand 17 states and 72 transitions. Second operand 3 states. [2020-06-22 10:37:12,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:37:12,322 INFO L93 Difference]: Finished difference Result 40 states and 184 transitions. [2020-06-22 10:37:12,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:37:12,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-06-22 10:37:12,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:37:12,324 INFO L225 Difference]: With dead ends: 40 [2020-06-22 10:37:12,324 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 10:37:12,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:37:12,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 10:37:12,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2020-06-22 10:37:12,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 10:37:12,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2020-06-22 10:37:12,331 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 80 transitions. Word has length 8 [2020-06-22 10:37:12,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:37:12,331 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 80 transitions. [2020-06-22 10:37:12,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:37:12,331 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 80 transitions. [2020-06-22 10:37:12,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 10:37:12,332 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:37:12,332 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:37:12,332 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:37:12,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:12,332 INFO L82 PathProgramCache]: Analyzing trace with hash -256982146, now seen corresponding path program 1 times [2020-06-22 10:37:12,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:12,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:12,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:12,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:12,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:12,337 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:12,337 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:12,338 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:12,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:12,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:37:12,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:12,413 INFO L340 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-06-22 10:37:12,414 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2020-06-22 10:37:12,415 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:37:12,422 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:37:12,424 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:37:12,424 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2020-06-22 10:37:12,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:37:12,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:37:12,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:37:12,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:37:12,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:37:12,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:37:12,474 INFO L87 Difference]: Start difference. First operand 18 states and 80 transitions. Second operand 3 states. [2020-06-22 10:37:12,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:37:12,576 INFO L93 Difference]: Finished difference Result 18 states and 80 transitions. [2020-06-22 10:37:12,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:37:12,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-06-22 10:37:12,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:37:12,577 INFO L225 Difference]: With dead ends: 18 [2020-06-22 10:37:12,577 INFO L226 Difference]: Without dead ends: 16 [2020-06-22 10:37:12,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:37:12,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-06-22 10:37:12,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-06-22 10:37:12,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 10:37:12,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 76 transitions. [2020-06-22 10:37:12,582 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 76 transitions. Word has length 8 [2020-06-22 10:37:12,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:37:12,582 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 76 transitions. [2020-06-22 10:37:12,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:37:12,583 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 76 transitions. [2020-06-22 10:37:12,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 10:37:12,583 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:37:12,583 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:37:12,584 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:37:12,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:12,584 INFO L82 PathProgramCache]: Analyzing trace with hash -256982144, now seen corresponding path program 1 times [2020-06-22 10:37:12,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:12,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:12,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:12,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:12,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:12,589 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:12,589 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:12,589 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:12,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:12,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:37:12,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:12,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:37:12,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:37:12,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:37:12,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:37:12,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:37:12,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:37:12,649 INFO L87 Difference]: Start difference. First operand 16 states and 76 transitions. Second operand 4 states. [2020-06-22 10:37:12,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:37:12,740 INFO L93 Difference]: Finished difference Result 25 states and 122 transitions. [2020-06-22 10:37:12,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:37:12,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-06-22 10:37:12,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:37:12,741 INFO L225 Difference]: With dead ends: 25 [2020-06-22 10:37:12,742 INFO L226 Difference]: Without dead ends: 16 [2020-06-22 10:37:12,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:37:12,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-06-22 10:37:12,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-06-22 10:37:12,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 10:37:12,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 50 transitions. [2020-06-22 10:37:12,746 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 50 transitions. Word has length 8 [2020-06-22 10:37:12,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:37:12,746 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 50 transitions. [2020-06-22 10:37:12,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:37:12,746 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 50 transitions. [2020-06-22 10:37:12,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 10:37:12,747 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:37:12,747 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:37:12,747 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:37:12,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:12,747 INFO L82 PathProgramCache]: Analyzing trace with hash -256982143, now seen corresponding path program 1 times [2020-06-22 10:37:12,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:12,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:12,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:12,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:12,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:12,752 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:12,752 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:12,752 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:12,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:12,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:37:12,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:12,792 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 10:37:12,792 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:37:12,800 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:37:12,804 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2020-06-22 10:37:12,804 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:37:12,814 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:37:12,815 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-06-22 10:37:12,815 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:30, output treesize:27 [2020-06-22 10:37:12,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:37:12,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:37:12,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 10:37:12,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 10:37:12,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 10:37:12,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:37:12,872 INFO L87 Difference]: Start difference. First operand 16 states and 50 transitions. Second operand 5 states. [2020-06-22 10:37:28,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:37:28,805 INFO L93 Difference]: Finished difference Result 25 states and 78 transitions. [2020-06-22 10:37:28,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:37:28,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-06-22 10:37:28,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:37:28,806 INFO L225 Difference]: With dead ends: 25 [2020-06-22 10:37:28,806 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 10:37:28,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-06-22 10:37:28,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 10:37:28,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 10:37:28,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 10:37:28,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2020-06-22 10:37:28,811 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 8 [2020-06-22 10:37:28,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:37:28,811 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2020-06-22 10:37:28,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 10:37:28,812 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2020-06-22 10:37:28,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 10:37:28,812 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:37:28,812 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:37:28,813 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:37:28,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:28,813 INFO L82 PathProgramCache]: Analyzing trace with hash -256994636, now seen corresponding path program 1 times [2020-06-22 10:37:28,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:28,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:28,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:28,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:28,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:28,818 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:28,818 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:28,818 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:28,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:28,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 10:37:28,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:28,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:37:28,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:37:28,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:37:28,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:37:28,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:37:28,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:37:28,878 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 3 states. [2020-06-22 10:37:28,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:37:28,921 INFO L93 Difference]: Finished difference Result 27 states and 62 transitions. [2020-06-22 10:37:28,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:37:28,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-06-22 10:37:28,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:37:28,922 INFO L225 Difference]: With dead ends: 27 [2020-06-22 10:37:28,922 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 10:37:28,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:37:28,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 10:37:28,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 10:37:28,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 10:37:28,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 40 transitions. [2020-06-22 10:37:28,927 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 40 transitions. Word has length 8 [2020-06-22 10:37:28,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:37:28,927 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 40 transitions. [2020-06-22 10:37:28,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:37:28,928 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 40 transitions. [2020-06-22 10:37:28,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 10:37:28,928 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:37:28,928 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:37:28,928 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:37:28,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:28,929 INFO L82 PathProgramCache]: Analyzing trace with hash -256965806, now seen corresponding path program 1 times [2020-06-22 10:37:28,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:28,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:28,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:28,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:28,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:28,934 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:28,934 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:28,935 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:28,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:28,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 10:37:28,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:28,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:37:28,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:37:28,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:37:28,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:37:28,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:37:28,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:37:28,998 INFO L87 Difference]: Start difference. First operand 18 states and 40 transitions. Second operand 3 states. [2020-06-22 10:37:29,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:37:29,043 INFO L93 Difference]: Finished difference Result 29 states and 61 transitions. [2020-06-22 10:37:29,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:37:29,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-06-22 10:37:29,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:37:29,045 INFO L225 Difference]: With dead ends: 29 [2020-06-22 10:37:29,045 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 10:37:29,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:37:29,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 10:37:29,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 10:37:29,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 10:37:29,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. [2020-06-22 10:37:29,050 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 37 transitions. Word has length 8 [2020-06-22 10:37:29,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:37:29,050 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 37 transitions. [2020-06-22 10:37:29,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:37:29,050 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 37 transitions. [2020-06-22 10:37:29,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 10:37:29,051 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:37:29,051 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:37:29,051 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:37:29,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:29,051 INFO L82 PathProgramCache]: Analyzing trace with hash -2145382971, now seen corresponding path program 1 times [2020-06-22 10:37:29,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:29,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:29,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:29,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:29,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:29,056 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:29,056 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:29,056 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:29,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:29,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:37:29,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:29,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:37:29,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:37:29,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 10:37:29,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 10:37:29,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 10:37:29,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:37:29,129 INFO L87 Difference]: Start difference. First operand 18 states and 37 transitions. Second operand 5 states. [2020-06-22 10:37:29,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:37:29,231 INFO L93 Difference]: Finished difference Result 41 states and 88 transitions. [2020-06-22 10:37:29,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:37:29,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-06-22 10:37:29,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:37:29,233 INFO L225 Difference]: With dead ends: 41 [2020-06-22 10:37:29,233 INFO L226 Difference]: Without dead ends: 32 [2020-06-22 10:37:29,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:37:29,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-06-22 10:37:29,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2020-06-22 10:37:29,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 10:37:29,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 53 transitions. [2020-06-22 10:37:29,241 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 53 transitions. Word has length 10 [2020-06-22 10:37:29,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:37:29,241 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 53 transitions. [2020-06-22 10:37:29,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 10:37:29,241 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 53 transitions. [2020-06-22 10:37:29,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 10:37:29,242 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:37:29,242 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:37:29,242 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:37:29,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:29,242 INFO L82 PathProgramCache]: Analyzing trace with hash 145616357, now seen corresponding path program 1 times [2020-06-22 10:37:29,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:29,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:29,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:29,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:29,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:29,246 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:29,247 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:29,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:29,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:29,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 10:37:29,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:29,284 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 10:37:29,284 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:37:29,291 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:37:29,294 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2020-06-22 10:37:29,295 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:37:29,303 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:37:29,304 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 10:37:29,305 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:24 [2020-06-22 10:37:29,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 10:37:29,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-06-22 10:37:29,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-06-22 10:37:29,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:37:29,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:37:29,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:37:29,363 INFO L87 Difference]: Start difference. First operand 26 states and 53 transitions. Second operand 4 states. [2020-06-22 10:37:39,689 WARN L188 SmtUtils]: Spent 5.02 s on a formula simplification that was a NOOP. DAG size: 25 [2020-06-22 10:37:39,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:37:39,806 INFO L93 Difference]: Finished difference Result 26 states and 53 transitions. [2020-06-22 10:37:39,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:37:39,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-06-22 10:37:39,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:37:39,807 INFO L225 Difference]: With dead ends: 26 [2020-06-22 10:37:39,807 INFO L226 Difference]: Without dead ends: 25 [2020-06-22 10:37:39,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:37:39,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-06-22 10:37:39,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2020-06-22 10:37:39,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 10:37:39,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 51 transitions. [2020-06-22 10:37:39,813 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 51 transitions. Word has length 10 [2020-06-22 10:37:39,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:37:39,814 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 51 transitions. [2020-06-22 10:37:39,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:37:39,814 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 51 transitions. [2020-06-22 10:37:39,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 10:37:39,814 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:37:39,814 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:37:39,815 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:37:39,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:39,815 INFO L82 PathProgramCache]: Analyzing trace with hash -2081007973, now seen corresponding path program 1 times [2020-06-22 10:37:39,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:39,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:39,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:39,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:39,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:39,820 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:39,820 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:39,820 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:39,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:39,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 10:37:39,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:39,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:37:39,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-06-22 10:37:39,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-06-22 10:37:39,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 10:37:39,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 10:37:39,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:37:39,893 INFO L87 Difference]: Start difference. First operand 24 states and 51 transitions. Second operand 5 states. [2020-06-22 10:37:39,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:37:39,988 INFO L93 Difference]: Finished difference Result 31 states and 66 transitions. [2020-06-22 10:37:39,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:37:39,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-06-22 10:37:39,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:37:39,989 INFO L225 Difference]: With dead ends: 31 [2020-06-22 10:37:39,989 INFO L226 Difference]: Without dead ends: 30 [2020-06-22 10:37:39,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-06-22 10:37:39,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-06-22 10:37:39,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2020-06-22 10:37:39,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 10:37:39,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 65 transitions. [2020-06-22 10:37:39,996 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 65 transitions. Word has length 11 [2020-06-22 10:37:39,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:37:39,996 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 65 transitions. [2020-06-22 10:37:39,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 10:37:39,996 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 65 transitions. [2020-06-22 10:37:39,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 10:37:39,997 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:37:39,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:37:39,997 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:37:39,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:39,997 INFO L82 PathProgramCache]: Analyzing trace with hash -2081007972, now seen corresponding path program 1 times [2020-06-22 10:37:39,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:39,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:39,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:39,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:39,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:40,002 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:40,002 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:40,002 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:40,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:40,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:37:40,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:40,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 10:37:40,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:37:40,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:37:40,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:37:40,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:37:40,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:37:40,069 INFO L87 Difference]: Start difference. First operand 27 states and 65 transitions. Second operand 4 states. [2020-06-22 10:37:40,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:37:40,111 INFO L93 Difference]: Finished difference Result 28 states and 65 transitions. [2020-06-22 10:37:40,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:37:40,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-06-22 10:37:40,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:37:40,112 INFO L225 Difference]: With dead ends: 28 [2020-06-22 10:37:40,113 INFO L226 Difference]: Without dead ends: 27 [2020-06-22 10:37:40,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:37:40,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-06-22 10:37:40,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-06-22 10:37:40,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 10:37:40,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 59 transitions. [2020-06-22 10:37:40,119 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 59 transitions. Word has length 11 [2020-06-22 10:37:40,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:37:40,119 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 59 transitions. [2020-06-22 10:37:40,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:37:40,119 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 59 transitions. [2020-06-22 10:37:40,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 10:37:40,120 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:37:40,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:37:40,120 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:37:40,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:40,121 INFO L82 PathProgramCache]: Analyzing trace with hash 220494459, now seen corresponding path program 1 times [2020-06-22 10:37:40,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:40,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:40,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:40,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:40,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:40,125 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:40,125 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:40,125 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:40,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:40,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 10:37:40,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:40,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:37:40,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:37:40,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 10:37:40,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 10:37:40,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 10:37:40,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:37:40,203 INFO L87 Difference]: Start difference. First operand 27 states and 59 transitions. Second operand 5 states. [2020-06-22 10:37:40,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:37:40,275 INFO L93 Difference]: Finished difference Result 28 states and 60 transitions. [2020-06-22 10:37:40,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:37:40,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-06-22 10:37:40,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:37:40,277 INFO L225 Difference]: With dead ends: 28 [2020-06-22 10:37:40,277 INFO L226 Difference]: Without dead ends: 27 [2020-06-22 10:37:40,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:37:40,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-06-22 10:37:40,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2020-06-22 10:37:40,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 10:37:40,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 47 transitions. [2020-06-22 10:37:40,283 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 47 transitions. Word has length 11 [2020-06-22 10:37:40,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:37:40,283 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 47 transitions. [2020-06-22 10:37:40,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 10:37:40,299 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 47 transitions. [2020-06-22 10:37:40,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 10:37:40,300 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:37:40,300 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:37:40,300 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:37:40,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:40,301 INFO L82 PathProgramCache]: Analyzing trace with hash -86739232, now seen corresponding path program 1 times [2020-06-22 10:37:40,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:40,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:40,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:40,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:40,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:40,305 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:40,305 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:40,305 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:40,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:40,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:37:40,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:40,348 INFO L340 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-06-22 10:37:40,348 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2020-06-22 10:37:40,349 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:37:40,353 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:37:40,353 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:37:40,354 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2020-06-22 10:37:40,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 10:37:40,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:37:40,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:37:40,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:37:40,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:37:40,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:37:40,388 INFO L87 Difference]: Start difference. First operand 23 states and 47 transitions. Second operand 3 states. [2020-06-22 10:37:40,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:37:40,424 INFO L93 Difference]: Finished difference Result 23 states and 47 transitions. [2020-06-22 10:37:40,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:37:40,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-06-22 10:37:40,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:37:40,425 INFO L225 Difference]: With dead ends: 23 [2020-06-22 10:37:40,425 INFO L226 Difference]: Without dead ends: 22 [2020-06-22 10:37:40,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:37:40,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-06-22 10:37:40,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-06-22 10:37:40,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 10:37:40,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 45 transitions. [2020-06-22 10:37:40,431 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 45 transitions. Word has length 12 [2020-06-22 10:37:40,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:37:40,431 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 45 transitions. [2020-06-22 10:37:40,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:37:40,431 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 45 transitions. [2020-06-22 10:37:40,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 10:37:40,432 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:37:40,432 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:37:40,432 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:37:40,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:40,432 INFO L82 PathProgramCache]: Analyzing trace with hash -86739230, now seen corresponding path program 1 times [2020-06-22 10:37:40,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:40,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:40,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:40,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:40,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:40,437 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:40,437 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:40,437 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:40,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:40,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:37:40,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:40,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 10:37:40,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:37:40,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:37:40,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:37:40,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:37:40,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:37:40,505 INFO L87 Difference]: Start difference. First operand 22 states and 45 transitions. Second operand 4 states. [2020-06-22 10:37:40,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:37:40,549 INFO L93 Difference]: Finished difference Result 23 states and 45 transitions. [2020-06-22 10:37:40,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:37:40,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-06-22 10:37:40,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:37:40,550 INFO L225 Difference]: With dead ends: 23 [2020-06-22 10:37:40,550 INFO L226 Difference]: Without dead ends: 22 [2020-06-22 10:37:40,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:37:40,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-06-22 10:37:40,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-06-22 10:37:40,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 10:37:40,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 44 transitions. [2020-06-22 10:37:40,557 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 44 transitions. Word has length 12 [2020-06-22 10:37:40,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:37:40,557 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 44 transitions. [2020-06-22 10:37:40,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:37:40,558 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 44 transitions. [2020-06-22 10:37:40,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 10:37:40,558 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:37:40,558 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:37:40,559 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== [2020-06-22 10:37:40,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:40,559 INFO L82 PathProgramCache]: Analyzing trace with hash -86739229, now seen corresponding path program 1 times [2020-06-22 10:37:40,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:40,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:40,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:40,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:40,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:40,563 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:40,563 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:40,563 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:40,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:40,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 10:37:40,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:40,613 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:37:40,614 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 35 [2020-06-22 10:37:40,614 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:37:40,636 INFO L497 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2020-06-22 10:37:40,638 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:37:40,638 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2020-06-22 10:37:40,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 10:37:40,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:37:40,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:37:40,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:37:40,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:37:40,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:37:40,687 INFO L87 Difference]: Start difference. First operand 22 states and 44 transitions. Second operand 4 states. [2020-06-22 10:37:40,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:37:40,793 INFO L93 Difference]: Finished difference Result 22 states and 44 transitions. [2020-06-22 10:37:40,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:37:40,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-06-22 10:37:40,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:37:40,794 INFO L225 Difference]: With dead ends: 22 [2020-06-22 10:37:40,794 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:37:40,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:37:40,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:37:40,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:37:40,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:37:40,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:37:40,795 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2020-06-22 10:37:40,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:37:40,795 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:37:40,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:37:40,795 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:37:40,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:37:40,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:37:40,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 10:37:41,011 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2020-06-22 10:37:46,146 WARN L188 SmtUtils]: Spent 5.13 s on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2020-06-22 10:37:46,148 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2020-06-22 10:37:46,148 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:37:46,148 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-06-22 10:37:46,149 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:37:46,149 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:37:46,149 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:37:46,149 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:37:46,149 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:37:46,149 INFO L444 ceAbstractionStarter]: At program point L13-3(lines 13 15) the Hoare annotation is: (and (= (* 4 ULTIMATE.start_main_~length~0) (select |#length| ULTIMATE.start_main_~arr~0.base)) (exists ((v_ULTIMATE.start_main_~i~0_20 Int)) (and (<= ULTIMATE.start_main_~i~0 (+ v_ULTIMATE.start_main_~i~0_20 1)) (<= (+ (* 4 v_ULTIMATE.start_main_~i~0_20) ULTIMATE.start_main_~arr~0.offset 4) (select |#length| ULTIMATE.start_main_~arr~0.base)))) (exists ((|ULTIMATE.start_main_#t~malloc3.base| Int)) (and (not (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc3.base|)) (= 1 (select |#valid| |ULTIMATE.start_main_#t~malloc3.base|)))) (= 1 (select |#valid| ULTIMATE.start_main_~arr2~0.base)) (= (* 4 (* ULTIMATE.start_main_~fac~0 ULTIMATE.start_main_~length~0)) (select |#length| ULTIMATE.start_main_~arr2~0.base)) (= (select |#valid| ULTIMATE.start_main_~arr~0.base) 1) (<= ULTIMATE.start_main_~arr~0.offset 0) (<= ULTIMATE.start_main_~arr2~0.offset 0) (<= 0 ULTIMATE.start_main_~arr~0.offset) (<= 0 ULTIMATE.start_main_~arr2~0.offset) (exists ((|ULTIMATE.start_main_#t~malloc3.base| Int) (ULTIMATE.start_main_~fac~0 Int) (ULTIMATE.start_main_~length~0 Int)) (and (<= 1 ULTIMATE.start_main_~length~0) (= (* 4 ULTIMATE.start_main_~length~0) (select |#length| ULTIMATE.start_main_~arr~0.base)) (= (* 4 (* ULTIMATE.start_main_~fac~0 ULTIMATE.start_main_~length~0)) (select |#length| |ULTIMATE.start_main_#t~malloc3.base|)) (not (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc3.base|)))) (<= 0 ULTIMATE.start_main_~i~0)) [2020-06-22 10:37:46,150 INFO L448 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2020-06-22 10:37:46,150 INFO L448 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2020-06-22 10:37:46,150 INFO L448 ceAbstractionStarter]: For program point L9-2(line 9) no Hoare annotation was computed. [2020-06-22 10:37:46,150 INFO L448 ceAbstractionStarter]: For program point L7-2(line 7) no Hoare annotation was computed. [2020-06-22 10:37:46,150 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:37:46,150 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2020-06-22 10:37:46,150 INFO L444 ceAbstractionStarter]: At program point L16-3(lines 16 18) the Hoare annotation is: (and (= (* 4 ULTIMATE.start_main_~length~0) (select |#length| ULTIMATE.start_main_~arr~0.base)) (<= ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~i~0) (exists ((|ULTIMATE.start_main_#t~malloc3.base| Int)) (and (not (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc3.base|)) (= 1 (select |#valid| |ULTIMATE.start_main_#t~malloc3.base|)))) (exists ((v_ULTIMATE.start_main_~i~0_20 Int)) (and (<= ULTIMATE.start_main_~i~0 (+ v_ULTIMATE.start_main_~i~0_20 1)) (<= (+ (* 4 v_ULTIMATE.start_main_~i~0_20) ULTIMATE.start_main_~arr~0.offset 4) (select |#length| ULTIMATE.start_main_~arr~0.base)))) (= 1 (select |#valid| ULTIMATE.start_main_~arr2~0.base)) (= (* 4 (* ULTIMATE.start_main_~fac~0 ULTIMATE.start_main_~length~0)) (select |#length| ULTIMATE.start_main_~arr2~0.base)) (= (select |#valid| ULTIMATE.start_main_~arr~0.base) 1) (<= ULTIMATE.start_main_~arr2~0.offset 0) (<= 0 ULTIMATE.start_main_~arr~0.offset) (<= 0 ULTIMATE.start_main_~j~0) (<= 0 ULTIMATE.start_main_~arr2~0.offset) (exists ((|ULTIMATE.start_main_#t~malloc3.base| Int) (ULTIMATE.start_main_~fac~0 Int) (ULTIMATE.start_main_~length~0 Int)) (and (<= 1 ULTIMATE.start_main_~length~0) (= (* 4 ULTIMATE.start_main_~length~0) (select |#length| ULTIMATE.start_main_~arr~0.base)) (= (* 4 (* ULTIMATE.start_main_~fac~0 ULTIMATE.start_main_~length~0)) (select |#length| |ULTIMATE.start_main_#t~malloc3.base|)) (not (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc3.base|))))) [2020-06-22 10:37:46,150 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2020-06-22 10:37:46,151 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:37:46,160 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] [2020-06-22 10:37:46,161 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] [2020-06-22 10:37:46,161 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:46,162 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:46,162 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 10:37:46,162 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 10:37:46,162 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~fac~0,QUANTIFIED] [2020-06-22 10:37:46,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 10:37:46,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:46,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:46,165 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:46,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:46,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:46,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:46,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:46,173 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] [2020-06-22 10:37:46,173 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] [2020-06-22 10:37:46,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:46,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:46,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 10:37:46,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 10:37:46,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~fac~0,QUANTIFIED] [2020-06-22 10:37:46,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 10:37:46,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:46,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:46,176 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:46,176 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:46,176 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:46,177 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:46,177 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:46,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:46,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:46,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] [2020-06-22 10:37:46,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] [2020-06-22 10:37:46,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 10:37:46,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 10:37:46,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~fac~0,QUANTIFIED] [2020-06-22 10:37:46,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 10:37:46,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:46,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:46,181 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:46,181 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:46,181 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:46,182 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:46,182 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:46,182 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:46,183 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:46,183 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] [2020-06-22 10:37:46,183 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] [2020-06-22 10:37:46,183 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 10:37:46,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 10:37:46,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~fac~0,QUANTIFIED] [2020-06-22 10:37:46,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 10:37:46,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:46,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:46,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:46,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:46,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:46,186 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:46,186 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:46,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:37:46 BasicIcfg [2020-06-22 10:37:46,188 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:37:46,189 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:37:46,189 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:37:46,192 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:37:46,193 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:37:46,193 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:35:55" (1/5) ... [2020-06-22 10:37:46,193 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@323d56ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:37:46, skipping insertion in model container [2020-06-22 10:37:46,193 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:37:46,194 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:35:55" (2/5) ... [2020-06-22 10:37:46,194 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@323d56ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:37:46, skipping insertion in model container [2020-06-22 10:37:46,194 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:37:46,194 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:35:56" (3/5) ... [2020-06-22 10:37:46,194 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@323d56ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:37:46, skipping insertion in model container [2020-06-22 10:37:46,194 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:37:46,195 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:37:09" (4/5) ... [2020-06-22 10:37:46,195 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@323d56ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:37:46, skipping insertion in model container [2020-06-22 10:37:46,195 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:37:46,195 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:37:46" (5/5) ... [2020-06-22 10:37:46,197 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:37:46,217 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:37:46,218 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:37:46,218 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:37:46,218 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:37:46,218 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:37:46,218 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:37:46,218 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:37:46,218 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:37:46,218 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:37:46,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-06-22 10:37:46,233 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-06-22 10:37:46,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:37:46,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:37:46,238 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:37:46,238 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 10:37:46,238 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:37:46,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-06-22 10:37:46,242 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-06-22 10:37:46,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:37:46,243 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:37:46,243 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:37:46,243 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 10:37:46,248 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue [1502] ULTIMATE.startENTRY-->L7: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_18| (store |v_#valid_19| 0 0))) InVars {#valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_9, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_9, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_7|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_8, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_7|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_7|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_18|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet5, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~fac~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~arr2~0.base, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~arr2~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 6#L7true [97] L7-->L7-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 3#L7-2true [64] L7-2-->L9: Formula: (= v_ULTIMATE.start_main_~fac~0_2 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~fac~0] 10#L9true [68] L9-->L9-2: Formula: (and (= v_ULTIMATE.start_main_~fac~0_3 1) (< v_ULTIMATE.start_main_~fac~0_4 1)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_4} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~fac~0] 7#L9-2true [111] L9-2-->L12: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr2~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc2.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 (* v_ULTIMATE.start_main_~fac~0_6 v_ULTIMATE.start_main_~length~0_7)))) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc2.base_2| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~arr~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= v_ULTIMATE.start_main_~arr2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_2, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_2, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_2, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_2|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, #valid, #length, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_~arr2~0.base, ULTIMATE.start_main_~arr2~0.offset] 16#L12true [127] L12-->L13-3: Formula: (and (= v_ULTIMATE.start_main_~i~0_4 0) (< v_ULTIMATE.start_main_~arr2~0.base_4 0) (< 0 v_ULTIMATE.start_main_~arr~0.offset_4)) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 12#L13-3true [2020-06-22 10:37:46,249 INFO L796 eck$LassoCheckResult]: Loop: 12#L13-3true [94] L13-3-->L14: Formula: (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} AuxVars[] AssignedVars[] 19#L14true [1506] L14-->L13-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_17))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_13)) (= (store |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13) .cse1 |v_ULTIMATE.start_main_#t~nondet5_8|)) |v_#memory_int_8|) (= (+ v_ULTIMATE.start_main_~i~0_17 1) v_ULTIMATE.start_main_~i~0_16) (<= 0 .cse1) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~arr~0.base_13))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, #length=|v_#length_11|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post4] 12#L13-3true [2020-06-22 10:37:46,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:46,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1030372600, now seen corresponding path program 1 times [2020-06-22 10:37:46,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:46,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:46,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:46,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:46,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:46,254 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:46,254 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:46,254 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:46,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:46,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 10:37:46,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:46,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:37:46,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:37:46,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:37:46,313 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 10:37:46,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:46,313 INFO L82 PathProgramCache]: Analyzing trace with hash 5381, now seen corresponding path program 1 times [2020-06-22 10:37:46,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:46,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:46,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:46,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:46,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:46,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:37:46,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:37:46,375 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2020-06-22 10:37:47,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:37:47,757 INFO L93 Difference]: Finished difference Result 17 states and 72 transitions. [2020-06-22 10:37:47,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:37:47,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 72 transitions. [2020-06-22 10:37:47,761 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-06-22 10:37:47,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 11 states and 38 transitions. [2020-06-22 10:37:47,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 10:37:47,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-06-22 10:37:47,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 38 transitions. [2020-06-22 10:37:47,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:37:47,764 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 38 transitions. [2020-06-22 10:37:47,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 38 transitions. [2020-06-22 10:37:47,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-06-22 10:37:47,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 10:37:47,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2020-06-22 10:37:47,767 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 38 transitions. [2020-06-22 10:37:47,767 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 38 transitions. [2020-06-22 10:37:47,767 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:37:47,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 38 transitions. [2020-06-22 10:37:47,767 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-06-22 10:37:47,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:37:47,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:37:47,768 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:37:47,768 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 10:37:47,768 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY [1502] ULTIMATE.startENTRY-->L7: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_18| (store |v_#valid_19| 0 0))) InVars {#valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_9, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_9, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_7|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_8, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_7|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_7|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_18|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet5, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~fac~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~arr2~0.base, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~arr2~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 65#L7 [97] L7-->L7-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 61#L7-2 [64] L7-2-->L9: Formula: (= v_ULTIMATE.start_main_~fac~0_2 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~fac~0] 62#L9 [68] L9-->L9-2: Formula: (and (= v_ULTIMATE.start_main_~fac~0_3 1) (< v_ULTIMATE.start_main_~fac~0_4 1)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_4} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~fac~0] 68#L9-2 [111] L9-2-->L12: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr2~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc2.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 (* v_ULTIMATE.start_main_~fac~0_6 v_ULTIMATE.start_main_~length~0_7)))) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc2.base_2| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~arr~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= v_ULTIMATE.start_main_~arr2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_2, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_2, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_2, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_2|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, #valid, #length, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_~arr2~0.base, ULTIMATE.start_main_~arr2~0.offset] 67#L12 [126] L12-->L13-3: Formula: (and (= v_ULTIMATE.start_main_~i~0_4 0) (> 0 v_ULTIMATE.start_main_~arr~0.offset_4) (< v_ULTIMATE.start_main_~arr2~0.base_4 0)) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_4, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 58#L13-3 [2020-06-22 10:37:47,769 INFO L796 eck$LassoCheckResult]: Loop: 58#L13-3 [94] L13-3-->L14: Formula: (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} AuxVars[] AssignedVars[] 60#L14 [1506] L14-->L13-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_17))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_13)) (= (store |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13) .cse1 |v_ULTIMATE.start_main_#t~nondet5_8|)) |v_#memory_int_8|) (= (+ v_ULTIMATE.start_main_~i~0_17 1) v_ULTIMATE.start_main_~i~0_16) (<= 0 .cse1) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~arr~0.base_13))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, #length=|v_#length_11|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post4] 58#L13-3 [2020-06-22 10:37:47,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:47,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1030372599, now seen corresponding path program 1 times [2020-06-22 10:37:47,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:47,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:47,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:47,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:47,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:47,773 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:47,773 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:47,773 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:47,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:47,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 10:37:47,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:47,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:37:47,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:37:47,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:37:47,823 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 10:37:47,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:47,824 INFO L82 PathProgramCache]: Analyzing trace with hash 5381, now seen corresponding path program 2 times [2020-06-22 10:37:47,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:47,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:47,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:47,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:47,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:47,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:37:47,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:37:47,858 INFO L87 Difference]: Start difference. First operand 11 states and 38 transitions. cyclomatic complexity: 29 Second operand 3 states. [2020-06-22 10:37:47,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:37:47,896 INFO L93 Difference]: Finished difference Result 11 states and 34 transitions. [2020-06-22 10:37:47,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:37:47,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 34 transitions. [2020-06-22 10:37:47,897 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-06-22 10:37:47,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 34 transitions. [2020-06-22 10:37:47,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 10:37:47,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-06-22 10:37:47,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 34 transitions. [2020-06-22 10:37:47,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:37:47,898 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 34 transitions. [2020-06-22 10:37:47,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 34 transitions. [2020-06-22 10:37:47,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-06-22 10:37:47,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 10:37:47,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 34 transitions. [2020-06-22 10:37:47,901 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 34 transitions. [2020-06-22 10:37:47,901 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 34 transitions. [2020-06-22 10:37:47,901 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 10:37:47,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 34 transitions. [2020-06-22 10:37:47,901 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-06-22 10:37:47,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:37:47,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:37:47,902 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:37:47,902 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 10:37:47,902 INFO L794 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY [1502] ULTIMATE.startENTRY-->L7: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_18| (store |v_#valid_19| 0 0))) InVars {#valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_9, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_9, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_7|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_8, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_7|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_7|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_18|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet5, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~fac~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~arr2~0.base, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~arr2~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 108#L7 [97] L7-->L7-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 104#L7-2 [64] L7-2-->L9: Formula: (= v_ULTIMATE.start_main_~fac~0_2 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~fac~0] 105#L9 [68] L9-->L9-2: Formula: (and (= v_ULTIMATE.start_main_~fac~0_3 1) (< v_ULTIMATE.start_main_~fac~0_4 1)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_4} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~fac~0] 111#L9-2 [111] L9-2-->L12: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr2~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc2.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 (* v_ULTIMATE.start_main_~fac~0_6 v_ULTIMATE.start_main_~length~0_7)))) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc2.base_2| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~arr~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= v_ULTIMATE.start_main_~arr2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_2, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_2, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_2, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_2|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, #valid, #length, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_~arr2~0.base, ULTIMATE.start_main_~arr2~0.offset] 110#L12 [123] L12-->L13-3: Formula: (and (= v_ULTIMATE.start_main_~i~0_4 0) (> v_ULTIMATE.start_main_~arr2~0.base_4 0) (> v_ULTIMATE.start_main_~arr~0.base_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 101#L13-3 [2020-06-22 10:37:47,903 INFO L796 eck$LassoCheckResult]: Loop: 101#L13-3 [94] L13-3-->L14: Formula: (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} AuxVars[] AssignedVars[] 103#L14 [1506] L14-->L13-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_17))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_13)) (= (store |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13) .cse1 |v_ULTIMATE.start_main_#t~nondet5_8|)) |v_#memory_int_8|) (= (+ v_ULTIMATE.start_main_~i~0_17 1) v_ULTIMATE.start_main_~i~0_16) (<= 0 .cse1) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~arr~0.base_13))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, #length=|v_#length_11|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post4] 101#L13-3 [2020-06-22 10:37:47,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:47,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1030372596, now seen corresponding path program 1 times [2020-06-22 10:37:47,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:47,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:47,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:47,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:37:47,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:47,906 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:47,906 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:47,907 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:47,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:47,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 10:37:47,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:47,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:37:47,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:37:47,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:37:47,957 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 10:37:47,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:47,958 INFO L82 PathProgramCache]: Analyzing trace with hash 5381, now seen corresponding path program 3 times [2020-06-22 10:37:47,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:47,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:47,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:47,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:47,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:47,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:37:47,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:37:47,993 INFO L87 Difference]: Start difference. First operand 11 states and 34 transitions. cyclomatic complexity: 25 Second operand 3 states. [2020-06-22 10:37:48,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:37:48,052 INFO L93 Difference]: Finished difference Result 17 states and 56 transitions. [2020-06-22 10:37:48,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:37:48,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 56 transitions. [2020-06-22 10:37:48,053 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2020-06-22 10:37:48,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 56 transitions. [2020-06-22 10:37:48,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-06-22 10:37:48,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-06-22 10:37:48,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 56 transitions. [2020-06-22 10:37:48,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:37:48,055 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 56 transitions. [2020-06-22 10:37:48,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 56 transitions. [2020-06-22 10:37:48,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2020-06-22 10:37:48,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-06-22 10:37:48,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 40 transitions. [2020-06-22 10:37:48,056 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 40 transitions. [2020-06-22 10:37:48,057 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 40 transitions. [2020-06-22 10:37:48,057 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 10:37:48,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 40 transitions. [2020-06-22 10:37:48,057 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-06-22 10:37:48,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:37:48,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:37:48,058 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:37:48,058 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 10:37:48,058 INFO L794 eck$LassoCheckResult]: Stem: 155#ULTIMATE.startENTRY [1502] ULTIMATE.startENTRY-->L7: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_18| (store |v_#valid_19| 0 0))) InVars {#valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_9, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_9, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_7|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_8, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_7|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_7|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_18|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet5, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~fac~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~arr2~0.base, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~arr2~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 156#L7 [97] L7-->L7-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 153#L7-2 [64] L7-2-->L9: Formula: (= v_ULTIMATE.start_main_~fac~0_2 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~fac~0] 154#L9 [68] L9-->L9-2: Formula: (and (= v_ULTIMATE.start_main_~fac~0_3 1) (< v_ULTIMATE.start_main_~fac~0_4 1)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_4} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~fac~0] 160#L9-2 [111] L9-2-->L12: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr2~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc2.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 (* v_ULTIMATE.start_main_~fac~0_6 v_ULTIMATE.start_main_~length~0_7)))) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc2.base_2| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~arr~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= v_ULTIMATE.start_main_~arr2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_2, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_2, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_2, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_2|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, #valid, #length, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_~arr2~0.base, ULTIMATE.start_main_~arr2~0.offset] 159#L12 [120] L12-->L13-3: Formula: (and (< 0 v_ULTIMATE.start_main_~arr2~0.offset_4) (= v_ULTIMATE.start_main_~i~0_4 0) (< v_ULTIMATE.start_main_~arr~0.base_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_4} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 150#L13-3 [2020-06-22 10:37:48,059 INFO L796 eck$LassoCheckResult]: Loop: 150#L13-3 [94] L13-3-->L14: Formula: (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} AuxVars[] AssignedVars[] 152#L14 [1506] L14-->L13-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_17))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_13)) (= (store |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13) .cse1 |v_ULTIMATE.start_main_#t~nondet5_8|)) |v_#memory_int_8|) (= (+ v_ULTIMATE.start_main_~i~0_17 1) v_ULTIMATE.start_main_~i~0_16) (<= 0 .cse1) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~arr~0.base_13))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, #length=|v_#length_11|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post4] 150#L13-3 [2020-06-22 10:37:48,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:48,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1030372593, now seen corresponding path program 1 times [2020-06-22 10:37:48,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:48,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:48,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:48,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:37:48,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:48,062 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:48,062 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:48,062 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:48,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:48,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 10:37:48,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:48,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:37:48,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:37:48,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:37:48,114 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 10:37:48,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:48,114 INFO L82 PathProgramCache]: Analyzing trace with hash 5381, now seen corresponding path program 4 times [2020-06-22 10:37:48,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:48,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:48,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:48,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:48,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:48,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:37:48,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:37:48,153 INFO L87 Difference]: Start difference. First operand 12 states and 40 transitions. cyclomatic complexity: 30 Second operand 3 states. [2020-06-22 10:37:48,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:37:48,216 INFO L93 Difference]: Finished difference Result 19 states and 63 transitions. [2020-06-22 10:37:48,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:37:48,217 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 63 transitions. [2020-06-22 10:37:48,217 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2020-06-22 10:37:48,218 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 63 transitions. [2020-06-22 10:37:48,218 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-06-22 10:37:48,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-06-22 10:37:48,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 63 transitions. [2020-06-22 10:37:48,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:37:48,219 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 63 transitions. [2020-06-22 10:37:48,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 63 transitions. [2020-06-22 10:37:48,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2020-06-22 10:37:48,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 10:37:48,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 47 transitions. [2020-06-22 10:37:48,220 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 47 transitions. [2020-06-22 10:37:48,220 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 47 transitions. [2020-06-22 10:37:48,220 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 10:37:48,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 47 transitions. [2020-06-22 10:37:48,221 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-06-22 10:37:48,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:37:48,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:37:48,222 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:37:48,222 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 10:37:48,222 INFO L794 eck$LassoCheckResult]: Stem: 208#ULTIMATE.startENTRY [1502] ULTIMATE.startENTRY-->L7: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_18| (store |v_#valid_19| 0 0))) InVars {#valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_9, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_9, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_7|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_8, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_7|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_7|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_18|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet5, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~fac~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~arr2~0.base, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~arr2~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 209#L7 [97] L7-->L7-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 205#L7-2 [64] L7-2-->L9: Formula: (= v_ULTIMATE.start_main_~fac~0_2 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~fac~0] 206#L9 [68] L9-->L9-2: Formula: (and (= v_ULTIMATE.start_main_~fac~0_3 1) (< v_ULTIMATE.start_main_~fac~0_4 1)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_4} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~fac~0] 212#L9-2 [112] L9-2-->L12: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr2~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc2.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 (* v_ULTIMATE.start_main_~fac~0_6 v_ULTIMATE.start_main_~length~0_7)))) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (< |v_ULTIMATE.start_main_#t~malloc2.base_2| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~arr~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= v_ULTIMATE.start_main_~arr2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_2, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_2, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_2, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_2|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, #valid, #length, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_~arr2~0.base, ULTIMATE.start_main_~arr2~0.offset] 213#L12 [120] L12-->L13-3: Formula: (and (< 0 v_ULTIMATE.start_main_~arr2~0.offset_4) (= v_ULTIMATE.start_main_~i~0_4 0) (< v_ULTIMATE.start_main_~arr~0.base_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_4} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 202#L13-3 [2020-06-22 10:37:48,222 INFO L796 eck$LassoCheckResult]: Loop: 202#L13-3 [94] L13-3-->L14: Formula: (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} AuxVars[] AssignedVars[] 204#L14 [1506] L14-->L13-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_17))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_13)) (= (store |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13) .cse1 |v_ULTIMATE.start_main_#t~nondet5_8|)) |v_#memory_int_8|) (= (+ v_ULTIMATE.start_main_~i~0_17 1) v_ULTIMATE.start_main_~i~0_16) (<= 0 .cse1) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~arr~0.base_13))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, #length=|v_#length_11|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post4] 202#L13-3 [2020-06-22 10:37:48,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:48,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1030372624, now seen corresponding path program 1 times [2020-06-22 10:37:48,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:48,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:48,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:48,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:37:48,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:48,226 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:48,226 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:48,226 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:48,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:48,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 10:37:48,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:37:48,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:37:48,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:37:48,278 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 10:37:48,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:48,278 INFO L82 PathProgramCache]: Analyzing trace with hash 5381, now seen corresponding path program 5 times [2020-06-22 10:37:48,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:48,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:48,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:48,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:48,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:48,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:37:48,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:37:48,319 INFO L87 Difference]: Start difference. First operand 14 states and 47 transitions. cyclomatic complexity: 35 Second operand 3 states. [2020-06-22 10:37:48,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:37:48,356 INFO L93 Difference]: Finished difference Result 14 states and 41 transitions. [2020-06-22 10:37:48,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:37:48,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 41 transitions. [2020-06-22 10:37:48,357 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-06-22 10:37:48,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 41 transitions. [2020-06-22 10:37:48,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-06-22 10:37:48,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-06-22 10:37:48,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 41 transitions. [2020-06-22 10:37:48,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:37:48,359 INFO L706 BuchiCegarLoop]: Abstraction has 14 states and 41 transitions. [2020-06-22 10:37:48,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 41 transitions. [2020-06-22 10:37:48,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-06-22 10:37:48,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 10:37:48,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 41 transitions. [2020-06-22 10:37:48,360 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 41 transitions. [2020-06-22 10:37:48,360 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 41 transitions. [2020-06-22 10:37:48,360 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 10:37:48,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 41 transitions. [2020-06-22 10:37:48,361 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-06-22 10:37:48,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:37:48,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:37:48,361 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:37:48,362 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 10:37:48,362 INFO L794 eck$LassoCheckResult]: Stem: 256#ULTIMATE.startENTRY [1502] ULTIMATE.startENTRY-->L7: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_18| (store |v_#valid_19| 0 0))) InVars {#valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_9, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_9, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_7|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_8, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_7|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_7|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_18|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet5, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~fac~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~arr2~0.base, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~arr2~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 257#L7 [97] L7-->L7-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 254#L7-2 [64] L7-2-->L9: Formula: (= v_ULTIMATE.start_main_~fac~0_2 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~fac~0] 255#L9 [68] L9-->L9-2: Formula: (and (= v_ULTIMATE.start_main_~fac~0_3 1) (< v_ULTIMATE.start_main_~fac~0_4 1)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_4} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~fac~0] 261#L9-2 [112] L9-2-->L12: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr2~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc2.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 (* v_ULTIMATE.start_main_~fac~0_6 v_ULTIMATE.start_main_~length~0_7)))) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (< |v_ULTIMATE.start_main_#t~malloc2.base_2| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~arr~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= v_ULTIMATE.start_main_~arr2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_2, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_2, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_2, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_2|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, #valid, #length, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_~arr2~0.base, ULTIMATE.start_main_~arr2~0.offset] 262#L12 [117] L12-->L13-3: Formula: (and (= v_ULTIMATE.start_main_~i~0_4 0) (< v_ULTIMATE.start_main_~arr~0.base_4 0) (> 0 v_ULTIMATE.start_main_~arr2~0.offset_4)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_4} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 251#L13-3 [2020-06-22 10:37:48,362 INFO L796 eck$LassoCheckResult]: Loop: 251#L13-3 [94] L13-3-->L14: Formula: (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} AuxVars[] AssignedVars[] 253#L14 [1506] L14-->L13-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_17))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_13)) (= (store |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13) .cse1 |v_ULTIMATE.start_main_#t~nondet5_8|)) |v_#memory_int_8|) (= (+ v_ULTIMATE.start_main_~i~0_17 1) v_ULTIMATE.start_main_~i~0_16) (<= 0 .cse1) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~arr~0.base_13))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, #length=|v_#length_11|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post4] 251#L13-3 [2020-06-22 10:37:48,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:48,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1030372621, now seen corresponding path program 1 times [2020-06-22 10:37:48,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:48,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:48,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:48,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:37:48,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:48,366 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:48,366 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:48,366 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:48,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:48,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 10:37:48,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:48,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:37:48,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:37:48,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:37:48,420 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 10:37:48,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:48,420 INFO L82 PathProgramCache]: Analyzing trace with hash 5381, now seen corresponding path program 6 times [2020-06-22 10:37:48,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:48,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:48,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:48,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:48,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:48,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:37:48,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:37:48,458 INFO L87 Difference]: Start difference. First operand 14 states and 41 transitions. cyclomatic complexity: 29 Second operand 3 states. [2020-06-22 10:37:48,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:37:48,494 INFO L93 Difference]: Finished difference Result 14 states and 35 transitions. [2020-06-22 10:37:48,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:37:48,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 35 transitions. [2020-06-22 10:37:48,495 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-06-22 10:37:48,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 35 transitions. [2020-06-22 10:37:48,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-06-22 10:37:48,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-06-22 10:37:48,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 35 transitions. [2020-06-22 10:37:48,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:37:48,496 INFO L706 BuchiCegarLoop]: Abstraction has 14 states and 35 transitions. [2020-06-22 10:37:48,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 35 transitions. [2020-06-22 10:37:48,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-06-22 10:37:48,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 10:37:48,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2020-06-22 10:37:48,498 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 35 transitions. [2020-06-22 10:37:48,498 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 35 transitions. [2020-06-22 10:37:48,498 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 10:37:48,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 35 transitions. [2020-06-22 10:37:48,499 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-06-22 10:37:48,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:37:48,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:37:48,499 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:37:48,499 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 10:37:48,500 INFO L794 eck$LassoCheckResult]: Stem: 306#ULTIMATE.startENTRY [1502] ULTIMATE.startENTRY-->L7: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_18| (store |v_#valid_19| 0 0))) InVars {#valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_9, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_9, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_7|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_8, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_7|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_7|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_18|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet5, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~fac~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~arr2~0.base, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~arr2~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 307#L7 [97] L7-->L7-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 303#L7-2 [64] L7-2-->L9: Formula: (= v_ULTIMATE.start_main_~fac~0_2 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~fac~0] 304#L9 [68] L9-->L9-2: Formula: (and (= v_ULTIMATE.start_main_~fac~0_3 1) (< v_ULTIMATE.start_main_~fac~0_4 1)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_4} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~fac~0] 310#L9-2 [112] L9-2-->L12: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr2~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc2.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 (* v_ULTIMATE.start_main_~fac~0_6 v_ULTIMATE.start_main_~length~0_7)))) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (< |v_ULTIMATE.start_main_#t~malloc2.base_2| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~arr~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= v_ULTIMATE.start_main_~arr2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_2, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_2, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_2, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_2|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, #valid, #length, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_~arr2~0.base, ULTIMATE.start_main_~arr2~0.offset] 311#L12 [131] L12-->L13-3: Formula: (and (= v_ULTIMATE.start_main_~i~0_4 0) (< v_ULTIMATE.start_main_~arr2~0.base_4 0) (> v_ULTIMATE.start_main_~arr~0.base_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 300#L13-3 [2020-06-22 10:37:48,500 INFO L796 eck$LassoCheckResult]: Loop: 300#L13-3 [94] L13-3-->L14: Formula: (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} AuxVars[] AssignedVars[] 302#L14 [1506] L14-->L13-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_17))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_13)) (= (store |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13) .cse1 |v_ULTIMATE.start_main_#t~nondet5_8|)) |v_#memory_int_8|) (= (+ v_ULTIMATE.start_main_~i~0_17 1) v_ULTIMATE.start_main_~i~0_16) (<= 0 .cse1) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~arr~0.base_13))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, #length=|v_#length_11|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post4] 300#L13-3 [2020-06-22 10:37:48,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:48,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1030372635, now seen corresponding path program 1 times [2020-06-22 10:37:48,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:48,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:48,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:48,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:37:48,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:48,504 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:48,504 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:48,504 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:48,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:48,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 10:37:48,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:48,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:37:48,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:37:48,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:37:48,553 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 10:37:48,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:48,554 INFO L82 PathProgramCache]: Analyzing trace with hash 5381, now seen corresponding path program 7 times [2020-06-22 10:37:48,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:48,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:48,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:48,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:48,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:48,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:37:48,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:37:48,588 INFO L87 Difference]: Start difference. First operand 14 states and 35 transitions. cyclomatic complexity: 23 Second operand 3 states. [2020-06-22 10:37:48,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:37:48,646 INFO L93 Difference]: Finished difference Result 19 states and 48 transitions. [2020-06-22 10:37:48,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:37:48,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 48 transitions. [2020-06-22 10:37:48,647 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2020-06-22 10:37:48,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 48 transitions. [2020-06-22 10:37:48,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-06-22 10:37:48,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-06-22 10:37:48,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 48 transitions. [2020-06-22 10:37:48,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:37:48,648 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 48 transitions. [2020-06-22 10:37:48,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 48 transitions. [2020-06-22 10:37:48,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2020-06-22 10:37:48,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 10:37:48,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 32 transitions. [2020-06-22 10:37:48,650 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 32 transitions. [2020-06-22 10:37:48,650 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 32 transitions. [2020-06-22 10:37:48,650 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-22 10:37:48,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 32 transitions. [2020-06-22 10:37:48,651 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-06-22 10:37:48,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:37:48,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:37:48,651 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:37:48,651 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 10:37:48,652 INFO L794 eck$LassoCheckResult]: Stem: 360#ULTIMATE.startENTRY [1502] ULTIMATE.startENTRY-->L7: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_18| (store |v_#valid_19| 0 0))) InVars {#valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_9, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_9, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_7|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_8, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_7|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_7|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_18|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet5, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~fac~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~arr2~0.base, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~arr2~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 361#L7 [97] L7-->L7-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 357#L7-2 [64] L7-2-->L9: Formula: (= v_ULTIMATE.start_main_~fac~0_2 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~fac~0] 358#L9 [68] L9-->L9-2: Formula: (and (= v_ULTIMATE.start_main_~fac~0_3 1) (< v_ULTIMATE.start_main_~fac~0_4 1)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_4} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~fac~0] 364#L9-2 [112] L9-2-->L12: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr2~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc2.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 (* v_ULTIMATE.start_main_~fac~0_6 v_ULTIMATE.start_main_~length~0_7)))) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (< |v_ULTIMATE.start_main_#t~malloc2.base_2| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~arr~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= v_ULTIMATE.start_main_~arr2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_2, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_2, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_2, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_2|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, #valid, #length, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_~arr2~0.base, ULTIMATE.start_main_~arr2~0.offset] 365#L12 [130] L12-->L13-3: Formula: (and (= v_ULTIMATE.start_main_~i~0_4 0) (< v_ULTIMATE.start_main_~arr~0.base_4 0) (< v_ULTIMATE.start_main_~arr2~0.base_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 354#L13-3 [2020-06-22 10:37:48,652 INFO L796 eck$LassoCheckResult]: Loop: 354#L13-3 [94] L13-3-->L14: Formula: (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} AuxVars[] AssignedVars[] 356#L14 [1506] L14-->L13-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_17))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_13)) (= (store |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13) .cse1 |v_ULTIMATE.start_main_#t~nondet5_8|)) |v_#memory_int_8|) (= (+ v_ULTIMATE.start_main_~i~0_17 1) v_ULTIMATE.start_main_~i~0_16) (<= 0 .cse1) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~arr~0.base_13))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, #length=|v_#length_11|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post4] 354#L13-3 [2020-06-22 10:37:48,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:48,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1030372634, now seen corresponding path program 1 times [2020-06-22 10:37:48,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:48,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:48,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:48,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:48,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:48,656 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:48,656 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:48,656 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:48,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:48,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:48,722 INFO L82 PathProgramCache]: Analyzing trace with hash 5381, now seen corresponding path program 8 times [2020-06-22 10:37:48,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:48,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:48,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:48,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:48,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:48,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:48,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1949339682, now seen corresponding path program 1 times [2020-06-22 10:37:48,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:48,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:48,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:48,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:37:48,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:48,734 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:48,734 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:48,734 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-06-22 10:37:48,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:49,031 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2020-06-22 10:37:49,104 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:37:49,106 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:37:49,106 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:37:49,106 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:37:49,106 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:37:49,106 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:37:49,106 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:37:49,106 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:37:49,107 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Lasso [2020-06-22 10:37:49,107 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:37:49,107 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:37:49,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:49,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:49,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:49,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:49,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:49,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:49,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:49,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:49,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:49,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:49,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:49,590 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:37:49,596 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:37:49,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:49,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:49,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:37:49,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:49,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:49,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:49,603 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:37:49,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:37:49,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:49,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:49,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:49,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:37:49,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:49,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:49,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:49,609 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:37:49,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:37:49,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:49,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:49,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:49,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:37:49,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:49,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:49,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:49,611 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:37:49,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:37:49,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:49,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:49,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:49,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:49,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:49,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:49,617 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:37:49,618 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:37:49,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:49,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:49,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:49,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:49,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:49,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:49,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:37:49,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:37:49,676 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:37:49,706 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-22 10:37:49,706 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 10:37:49,709 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:37:49,710 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:37:49,710 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:37:49,711 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 Supporting invariants [] [2020-06-22 10:37:49,740 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-06-22 10:37:49,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:49,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:49,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:37:49,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:49,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:37:49,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:49,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:37:49,780 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization [2020-06-22 10:37:49,784 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-06-22 10:37:49,785 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 32 transitions. cyclomatic complexity: 20 Second operand 3 states. [2020-06-22 10:37:49,897 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 32 transitions. cyclomatic complexity: 20. Second operand 3 states. Result 25 states and 68 transitions. Complement of second has 4 states. [2020-06-22 10:37:49,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 10:37:49,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 10:37:49,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2020-06-22 10:37:49,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 6 letters. Loop has 2 letters. [2020-06-22 10:37:49,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:37:49,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 8 letters. Loop has 2 letters. [2020-06-22 10:37:49,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:37:49,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 6 letters. Loop has 4 letters. [2020-06-22 10:37:49,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:37:50,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 68 transitions. [2020-06-22 10:37:50,033 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-06-22 10:37:50,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 21 states and 51 transitions. [2020-06-22 10:37:50,034 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-06-22 10:37:50,034 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-06-22 10:37:50,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 51 transitions. [2020-06-22 10:37:50,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:37:50,035 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 51 transitions. [2020-06-22 10:37:50,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 51 transitions. [2020-06-22 10:37:50,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2020-06-22 10:37:50,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 10:37:50,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2020-06-22 10:37:50,037 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 37 transitions. [2020-06-22 10:37:50,037 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 37 transitions. [2020-06-22 10:37:50,037 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2020-06-22 10:37:50,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 37 transitions. [2020-06-22 10:37:50,037 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-06-22 10:37:50,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:37:50,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:37:50,038 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:37:50,038 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 10:37:50,039 INFO L794 eck$LassoCheckResult]: Stem: 467#ULTIMATE.startENTRY [1502] ULTIMATE.startENTRY-->L7: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_18| (store |v_#valid_19| 0 0))) InVars {#valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_9, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_9, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_7|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_8, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_7|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_7|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_18|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet5, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~fac~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~arr2~0.base, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~arr2~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 468#L7 [97] L7-->L7-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 464#L7-2 [64] L7-2-->L9: Formula: (= v_ULTIMATE.start_main_~fac~0_2 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~fac~0] 465#L9 [68] L9-->L9-2: Formula: (and (= v_ULTIMATE.start_main_~fac~0_3 1) (< v_ULTIMATE.start_main_~fac~0_4 1)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_4} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~fac~0] 471#L9-2 [113] L9-2-->L12: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= v_ULTIMATE.start_main_~arr~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr2~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc2.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 (* v_ULTIMATE.start_main_~fac~0_6 v_ULTIMATE.start_main_~length~0_7)))) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc2.base_2| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~arr~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= v_ULTIMATE.start_main_~arr2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_2, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_2, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_2, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_2|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, #valid, #length, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_~arr2~0.base, ULTIMATE.start_main_~arr2~0.offset] 472#L12 [123] L12-->L13-3: Formula: (and (= v_ULTIMATE.start_main_~i~0_4 0) (> v_ULTIMATE.start_main_~arr2~0.base_4 0) (> v_ULTIMATE.start_main_~arr~0.base_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 476#L13-3 [2020-06-22 10:37:50,039 INFO L796 eck$LassoCheckResult]: Loop: 476#L13-3 [94] L13-3-->L14: Formula: (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} AuxVars[] AssignedVars[] 475#L14 [1506] L14-->L13-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_17))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_13)) (= (store |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13) .cse1 |v_ULTIMATE.start_main_#t~nondet5_8|)) |v_#memory_int_8|) (= (+ v_ULTIMATE.start_main_~i~0_17 1) v_ULTIMATE.start_main_~i~0_16) (<= 0 .cse1) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~arr~0.base_13))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, #length=|v_#length_11|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post4] 476#L13-3 [2020-06-22 10:37:50,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:50,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1030372658, now seen corresponding path program 1 times [2020-06-22 10:37:50,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:50,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:50,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:50,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:50,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:50,043 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:50,043 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:50,043 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:50,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:50,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:50,105 INFO L82 PathProgramCache]: Analyzing trace with hash 5381, now seen corresponding path program 9 times [2020-06-22 10:37:50,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:50,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:50,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:50,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:50,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:50,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:50,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1949316618, now seen corresponding path program 1 times [2020-06-22 10:37:50,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:50,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:50,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:50,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:37:50,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:50,115 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:50,115 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:50,115 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:50,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:50,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:50,312 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2020-06-22 10:37:50,360 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:37:50,360 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:37:50,360 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:37:50,360 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:37:50,360 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:37:50,360 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:37:50,361 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:37:50,361 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:37:50,361 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration9_Lasso [2020-06-22 10:37:50,361 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:37:50,361 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:37:50,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:50,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:50,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:50,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:50,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:50,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:50,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:50,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:50,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:50,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:50,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:50,684 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:37:50,685 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:37:50,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:50,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:50,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:50,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:50,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:50,687 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:37:50,688 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:37:50,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:50,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:50,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:50,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:50,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:50,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:50,693 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:37:50,693 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:37:50,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:50,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:50,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:50,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:37:50,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:50,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:50,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:50,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:37:50,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:37:50,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:50,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:50,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:50,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:37:50,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:50,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:50,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:50,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:37:50,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:37:50,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:50,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:50,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:50,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:37:50,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:50,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:50,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:50,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:37:50,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:37:50,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:50,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:50,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:50,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:50,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:50,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:50,704 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:37:50,704 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:37:50,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:50,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:50,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:50,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:50,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:50,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:50,715 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:37:50,715 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:37:50,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:50,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:50,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:50,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:37:50,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:50,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:50,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:50,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:37:50,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:37:50,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:50,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:50,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:50,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:50,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:50,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:50,722 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:37:50,722 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:37:50,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:50,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:50,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:50,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:50,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:50,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:50,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:37:50,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:37:50,746 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:37:50,765 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-22 10:37:50,766 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2020-06-22 10:37:50,766 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:37:50,768 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:37:50,768 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:37:50,768 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2, ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~arr~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2 - 4*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-06-22 10:37:50,782 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-06-22 10:37:50,783 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:50,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:50,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:37:50,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:50,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:37:50,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:50,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:37:50,812 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization [2020-06-22 10:37:50,812 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-06-22 10:37:50,813 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 37 transitions. cyclomatic complexity: 23 Second operand 3 states. [2020-06-22 10:37:50,887 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 37 transitions. cyclomatic complexity: 23. Second operand 3 states. Result 28 states and 73 transitions. Complement of second has 4 states. [2020-06-22 10:37:50,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 10:37:50,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 10:37:50,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2020-06-22 10:37:50,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 6 letters. Loop has 2 letters. [2020-06-22 10:37:50,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:37:50,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 8 letters. Loop has 2 letters. [2020-06-22 10:37:50,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:37:50,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 6 letters. Loop has 4 letters. [2020-06-22 10:37:50,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:37:50,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 73 transitions. [2020-06-22 10:37:50,992 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-06-22 10:37:50,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 24 states and 56 transitions. [2020-06-22 10:37:50,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-06-22 10:37:50,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-06-22 10:37:50,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 56 transitions. [2020-06-22 10:37:50,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:37:50,993 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 56 transitions. [2020-06-22 10:37:50,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 56 transitions. [2020-06-22 10:37:50,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2020-06-22 10:37:50,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 10:37:50,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2020-06-22 10:37:50,995 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 37 transitions. [2020-06-22 10:37:50,995 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 37 transitions. [2020-06-22 10:37:50,995 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2020-06-22 10:37:50,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 37 transitions. [2020-06-22 10:37:50,996 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-06-22 10:37:50,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:37:50,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:37:50,996 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:37:50,996 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 10:37:50,997 INFO L794 eck$LassoCheckResult]: Stem: 579#ULTIMATE.startENTRY [1502] ULTIMATE.startENTRY-->L7: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_18| (store |v_#valid_19| 0 0))) InVars {#valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_9, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_9, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_7|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_8, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_7|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_7|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_18|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet5, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~fac~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~arr2~0.base, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~arr2~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 580#L7 [97] L7-->L7-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 576#L7-2 [64] L7-2-->L9: Formula: (= v_ULTIMATE.start_main_~fac~0_2 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~fac~0] 577#L9 [68] L9-->L9-2: Formula: (and (= v_ULTIMATE.start_main_~fac~0_3 1) (< v_ULTIMATE.start_main_~fac~0_4 1)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_4} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~fac~0] 583#L9-2 [113] L9-2-->L12: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= v_ULTIMATE.start_main_~arr~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr2~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc2.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 (* v_ULTIMATE.start_main_~fac~0_6 v_ULTIMATE.start_main_~length~0_7)))) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc2.base_2| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~arr~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= v_ULTIMATE.start_main_~arr2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_2, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_2, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_2, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_2|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, #valid, #length, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_~arr2~0.base, ULTIMATE.start_main_~arr2~0.offset] 584#L12 [131] L12-->L13-3: Formula: (and (= v_ULTIMATE.start_main_~i~0_4 0) (< v_ULTIMATE.start_main_~arr2~0.base_4 0) (> v_ULTIMATE.start_main_~arr~0.base_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 588#L13-3 [2020-06-22 10:37:50,997 INFO L796 eck$LassoCheckResult]: Loop: 588#L13-3 [94] L13-3-->L14: Formula: (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} AuxVars[] AssignedVars[] 587#L14 [1506] L14-->L13-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_17))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_13)) (= (store |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13) .cse1 |v_ULTIMATE.start_main_#t~nondet5_8|)) |v_#memory_int_8|) (= (+ v_ULTIMATE.start_main_~i~0_17 1) v_ULTIMATE.start_main_~i~0_16) (<= 0 .cse1) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~arr~0.base_13))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, #length=|v_#length_11|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post4] 588#L13-3 [2020-06-22 10:37:50,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:50,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1030372666, now seen corresponding path program 1 times [2020-06-22 10:37:50,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:50,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:50,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:50,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:50,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:51,001 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:51,001 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:51,001 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:51,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:51,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 10:37:51,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:51,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:37:51,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:37:51,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:37:51,062 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 10:37:51,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:51,062 INFO L82 PathProgramCache]: Analyzing trace with hash 5381, now seen corresponding path program 10 times [2020-06-22 10:37:51,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:51,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:51,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:51,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:51,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:51,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:37:51,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:37:51,108 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. cyclomatic complexity: 23 Second operand 3 states. [2020-06-22 10:37:51,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:37:51,188 INFO L93 Difference]: Finished difference Result 25 states and 56 transitions. [2020-06-22 10:37:51,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:37:51,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 56 transitions. [2020-06-22 10:37:51,312 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2020-06-22 10:37:51,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 56 transitions. [2020-06-22 10:37:51,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-06-22 10:37:51,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-06-22 10:37:51,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 56 transitions. [2020-06-22 10:37:51,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:37:51,313 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 56 transitions. [2020-06-22 10:37:51,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 56 transitions. [2020-06-22 10:37:51,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2020-06-22 10:37:51,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 10:37:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 35 transitions. [2020-06-22 10:37:51,315 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 35 transitions. [2020-06-22 10:37:51,315 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 35 transitions. [2020-06-22 10:37:51,315 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2020-06-22 10:37:51,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 35 transitions. [2020-06-22 10:37:51,315 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-06-22 10:37:51,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:37:51,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:37:51,316 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:37:51,316 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 10:37:51,316 INFO L794 eck$LassoCheckResult]: Stem: 641#ULTIMATE.startENTRY [1502] ULTIMATE.startENTRY-->L7: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_18| (store |v_#valid_19| 0 0))) InVars {#valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_9, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_9, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_7|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_8, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_7|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_7|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_18|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet5, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~fac~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~arr2~0.base, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~arr2~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 642#L7 [97] L7-->L7-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 639#L7-2 [64] L7-2-->L9: Formula: (= v_ULTIMATE.start_main_~fac~0_2 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~fac~0] 640#L9 [68] L9-->L9-2: Formula: (and (= v_ULTIMATE.start_main_~fac~0_3 1) (< v_ULTIMATE.start_main_~fac~0_4 1)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_4} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~fac~0] 646#L9-2 [110] L9-2-->L12: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= v_ULTIMATE.start_main_~arr~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr2~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc2.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 (* v_ULTIMATE.start_main_~fac~0_6 v_ULTIMATE.start_main_~length~0_7)))) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (< |v_ULTIMATE.start_main_#t~malloc2.base_2| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~arr~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= v_ULTIMATE.start_main_~arr2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_2, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_2, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_2, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_2|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, #valid, #length, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_~arr2~0.base, ULTIMATE.start_main_~arr2~0.offset] 648#L12 [119] L12-->L13-3: Formula: (and (= v_ULTIMATE.start_main_~i~0_4 0) (< v_ULTIMATE.start_main_~arr~0.base_4 0) (> v_ULTIMATE.start_main_~arr2~0.base_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 651#L13-3 [2020-06-22 10:37:51,317 INFO L796 eck$LassoCheckResult]: Loop: 651#L13-3 [94] L13-3-->L14: Formula: (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} AuxVars[] AssignedVars[] 650#L14 [1506] L14-->L13-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_17))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_13)) (= (store |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13) .cse1 |v_ULTIMATE.start_main_#t~nondet5_8|)) |v_#memory_int_8|) (= (+ v_ULTIMATE.start_main_~i~0_17 1) v_ULTIMATE.start_main_~i~0_16) (<= 0 .cse1) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~arr~0.base_13))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, #length=|v_#length_11|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post4] 651#L13-3 [2020-06-22 10:37:51,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:51,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1030372561, now seen corresponding path program 1 times [2020-06-22 10:37:51,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:51,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:51,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:51,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:37:51,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:51,320 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:51,320 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:51,320 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:51,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:51,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:51,379 INFO L82 PathProgramCache]: Analyzing trace with hash 5381, now seen corresponding path program 11 times [2020-06-22 10:37:51,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:51,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:51,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:51,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:51,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:51,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:51,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1949409835, now seen corresponding path program 1 times [2020-06-22 10:37:51,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:51,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:51,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:51,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:37:51,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:51,388 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:51,388 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:51,388 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:51,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:51,575 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2020-06-22 10:37:51,615 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:37:51,616 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:37:51,616 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:37:51,616 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:37:51,616 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:37:51,616 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:37:51,616 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:37:51,616 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:37:51,616 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration11_Lasso [2020-06-22 10:37:51,617 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:37:51,617 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:37:51,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:51,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:51,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:51,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:51,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:51,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:51,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:51,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:51,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:51,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:51,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:51,943 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:37:51,944 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:37:51,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:51,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:51,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:37:51,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:51,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:51,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:51,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:37:51,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:37:51,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:51,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:51,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:51,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:37:51,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:51,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:51,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:51,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:37:51,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:37:51,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:51,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:51,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:51,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:37:51,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:51,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:51,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:51,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:37:51,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:37:51,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:51,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:51,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:51,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:37:51,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:51,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:51,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:51,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:37:51,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:37:51,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:51,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:51,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:51,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:51,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:51,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:51,953 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:37:51,953 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:37:51,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:51,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:51,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:51,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:51,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:51,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:51,958 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:37:51,958 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:37:51,971 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:37:51,980 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 10:37:51,981 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:37:51,981 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:37:51,982 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:37:51,982 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:37:51,982 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2020-06-22 10:37:52,004 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-06-22 10:37:52,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:52,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:37:52,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:52,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:37:52,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:52,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:37:52,058 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 10:37:52,058 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-06-22 10:37:52,058 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 35 transitions. cyclomatic complexity: 21 Second operand 3 states. [2020-06-22 10:37:52,192 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 35 transitions. cyclomatic complexity: 21. Second operand 3 states. Result 37 states and 106 transitions. Complement of second has 7 states. [2020-06-22 10:37:52,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 10:37:52,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 10:37:52,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2020-06-22 10:37:52,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 73 transitions. Stem has 6 letters. Loop has 2 letters. [2020-06-22 10:37:52,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:37:52,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 73 transitions. Stem has 8 letters. Loop has 2 letters. [2020-06-22 10:37:52,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:37:52,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 73 transitions. Stem has 6 letters. Loop has 4 letters. [2020-06-22 10:37:52,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:37:52,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 106 transitions. [2020-06-22 10:37:52,294 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-06-22 10:37:52,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 27 states and 63 transitions. [2020-06-22 10:37:52,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-06-22 10:37:52,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-06-22 10:37:52,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 63 transitions. [2020-06-22 10:37:52,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:37:52,296 INFO L706 BuchiCegarLoop]: Abstraction has 27 states and 63 transitions. [2020-06-22 10:37:52,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 63 transitions. [2020-06-22 10:37:52,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2020-06-22 10:37:52,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 10:37:52,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 62 transitions. [2020-06-22 10:37:52,297 INFO L729 BuchiCegarLoop]: Abstraction has 26 states and 62 transitions. [2020-06-22 10:37:52,297 INFO L609 BuchiCegarLoop]: Abstraction has 26 states and 62 transitions. [2020-06-22 10:37:52,297 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2020-06-22 10:37:52,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 62 transitions. [2020-06-22 10:37:52,298 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2020-06-22 10:37:52,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:37:52,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:37:52,299 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:37:52,299 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 10:37:52,299 INFO L794 eck$LassoCheckResult]: Stem: 768#ULTIMATE.startENTRY [1502] ULTIMATE.startENTRY-->L7: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_18| (store |v_#valid_19| 0 0))) InVars {#valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_9, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_9, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_7|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_8, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_7|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_7|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_18|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet5, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~fac~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~arr2~0.base, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~arr2~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 769#L7 [97] L7-->L7-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 766#L7-2 [64] L7-2-->L9: Formula: (= v_ULTIMATE.start_main_~fac~0_2 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~fac~0] 767#L9 [68] L9-->L9-2: Formula: (and (= v_ULTIMATE.start_main_~fac~0_3 1) (< v_ULTIMATE.start_main_~fac~0_4 1)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_4} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~fac~0] 775#L9-2 [111] L9-2-->L12: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr2~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc2.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 (* v_ULTIMATE.start_main_~fac~0_6 v_ULTIMATE.start_main_~length~0_7)))) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc2.base_2| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~arr~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= v_ULTIMATE.start_main_~arr2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_2, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_2, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_2, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_2|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, #valid, #length, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_~arr2~0.base, ULTIMATE.start_main_~arr2~0.offset] 778#L12 [131] L12-->L13-3: Formula: (and (= v_ULTIMATE.start_main_~i~0_4 0) (< v_ULTIMATE.start_main_~arr2~0.base_4 0) (> v_ULTIMATE.start_main_~arr~0.base_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 781#L13-3 [2020-06-22 10:37:52,299 INFO L796 eck$LassoCheckResult]: Loop: 781#L13-3 [94] L13-3-->L14: Formula: (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} AuxVars[] AssignedVars[] 780#L14 [1506] L14-->L13-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_17))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_13)) (= (store |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13) .cse1 |v_ULTIMATE.start_main_#t~nondet5_8|)) |v_#memory_int_8|) (= (+ v_ULTIMATE.start_main_~i~0_17 1) v_ULTIMATE.start_main_~i~0_16) (<= 0 .cse1) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~arr~0.base_13))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, #length=|v_#length_11|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post4] 781#L13-3 [2020-06-22 10:37:52,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:52,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1030372604, now seen corresponding path program 1 times [2020-06-22 10:37:52,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:52,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:52,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:52,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:52,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:52,303 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:52,303 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:52,303 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:52,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:52,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:52,367 INFO L82 PathProgramCache]: Analyzing trace with hash 5381, now seen corresponding path program 12 times [2020-06-22 10:37:52,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:52,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:52,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:52,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:52,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:52,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:52,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1949368512, now seen corresponding path program 1 times [2020-06-22 10:37:52,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:52,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:52,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:52,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:37:52,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:52,376 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:52,376 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:52,377 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:52,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:52,633 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2020-06-22 10:37:52,686 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:37:52,686 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:37:52,686 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:37:52,686 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:37:52,686 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:37:52,686 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:37:52,687 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:37:52,687 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:37:52,687 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration12_Lasso [2020-06-22 10:37:52,687 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:37:52,687 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:37:52,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:52,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:52,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:52,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:52,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:52,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:52,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:52,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:52,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:52,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:52,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:53,000 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:37:53,000 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:37:53,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:53,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:53,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:37:53,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:53,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:53,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:53,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:37:53,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:37:53,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:53,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:53,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:53,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:53,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:53,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:53,005 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:37:53,005 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:37:53,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:53,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:53,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:53,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:37:53,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:53,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:53,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:53,008 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:37:53,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:37:53,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:53,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:53,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:53,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:37:53,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:53,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:53,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:53,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:37:53,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:37:53,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:53,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:53,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:53,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:37:53,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:53,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:53,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:53,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:37:53,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:37:53,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:53,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:53,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:53,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:37:53,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:53,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:53,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:53,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:37:53,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:37:53,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:53,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:53,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:53,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:53,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:53,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:53,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:37:53,015 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:37:53,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:53,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:53,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:53,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:53,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:53,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:53,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:37:53,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:37:53,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:53,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:53,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:53,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:37:53,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:53,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:53,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:53,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:37:53,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:37:53,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:53,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:53,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:53,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:37:53,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:53,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:53,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:53,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:37:53,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:37:53,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:53,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:53,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:53,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:53,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:53,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:53,026 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:37:53,026 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:37:53,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:53,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:53,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:53,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:53,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:53,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:53,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:37:53,031 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:37:53,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:53,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:53,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:53,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:53,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:53,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:53,036 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:37:53,036 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:37:53,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:53,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:53,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:53,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:37:53,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:53,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:53,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:53,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:37:53,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:37:53,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:53,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:53,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:53,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:37:53,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:53,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:53,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:53,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:37:53,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:37:53,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:53,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:53,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:53,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:53,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:53,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:53,044 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:37:53,044 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:37:53,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:53,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:53,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:53,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:53,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:53,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:53,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:37:53,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:37:53,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:53,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:53,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:53,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:53,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:53,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:53,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:37:53,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:37:53,065 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:37:53,071 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 10:37:53,071 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:37:53,072 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:37:53,073 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:37:53,073 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:37:53,073 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2020-06-22 10:37:53,085 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-06-22 10:37:53,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:53,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:37:53,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:53,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:37:53,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:53,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:37:53,130 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 10:37:53,130 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-06-22 10:37:53,130 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 26 states and 62 transitions. cyclomatic complexity: 42 Second operand 3 states. [2020-06-22 10:37:53,230 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 26 states and 62 transitions. cyclomatic complexity: 42. Second operand 3 states. Result 44 states and 130 transitions. Complement of second has 7 states. [2020-06-22 10:37:53,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 10:37:53,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 10:37:53,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2020-06-22 10:37:53,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 73 transitions. Stem has 6 letters. Loop has 2 letters. [2020-06-22 10:37:53,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:37:53,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 73 transitions. Stem has 8 letters. Loop has 2 letters. [2020-06-22 10:37:53,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:37:53,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 73 transitions. Stem has 6 letters. Loop has 4 letters. [2020-06-22 10:37:53,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:37:53,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 130 transitions. [2020-06-22 10:37:53,327 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2020-06-22 10:37:53,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 34 states and 87 transitions. [2020-06-22 10:37:53,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-06-22 10:37:53,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-06-22 10:37:53,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 87 transitions. [2020-06-22 10:37:53,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:37:53,328 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 87 transitions. [2020-06-22 10:37:53,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 87 transitions. [2020-06-22 10:37:53,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 24. [2020-06-22 10:37:53,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 10:37:53,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 59 transitions. [2020-06-22 10:37:53,330 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 59 transitions. [2020-06-22 10:37:53,330 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 59 transitions. [2020-06-22 10:37:53,330 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2020-06-22 10:37:53,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 59 transitions. [2020-06-22 10:37:53,331 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-06-22 10:37:53,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:37:53,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:37:53,331 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:37:53,331 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:37:53,332 INFO L794 eck$LassoCheckResult]: Stem: 911#ULTIMATE.startENTRY [1502] ULTIMATE.startENTRY-->L7: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_18| (store |v_#valid_19| 0 0))) InVars {#valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_9, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_9, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_7|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_8, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_7|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_7|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_18|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet5, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~fac~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~arr2~0.base, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~arr2~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 912#L7 [97] L7-->L7-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 909#L7-2 [64] L7-2-->L9: Formula: (= v_ULTIMATE.start_main_~fac~0_2 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~fac~0] 910#L9 [68] L9-->L9-2: Formula: (and (= v_ULTIMATE.start_main_~fac~0_3 1) (< v_ULTIMATE.start_main_~fac~0_4 1)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_4} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~fac~0] 918#L9-2 [112] L9-2-->L12: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr2~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc2.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 (* v_ULTIMATE.start_main_~fac~0_6 v_ULTIMATE.start_main_~length~0_7)))) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (< |v_ULTIMATE.start_main_#t~malloc2.base_2| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~arr~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= v_ULTIMATE.start_main_~arr2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_2, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_2, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_2, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_2|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, #valid, #length, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_~arr2~0.base, ULTIMATE.start_main_~arr2~0.offset] 919#L12 [130] L12-->L13-3: Formula: (and (= v_ULTIMATE.start_main_~i~0_4 0) (< v_ULTIMATE.start_main_~arr~0.base_4 0) (< v_ULTIMATE.start_main_~arr2~0.base_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 917#L13-3 [1504] L13-3-->L16-3: Formula: (and (= 0 v_ULTIMATE.start_main_~j~0_12) (<= v_ULTIMATE.start_main_~length~0_15 v_ULTIMATE.start_main_~i~0_14)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 926#L16-3 [2020-06-22 10:37:53,332 INFO L796 eck$LassoCheckResult]: Loop: 926#L16-3 [77] L16-3-->L17: Formula: (< v_ULTIMATE.start_main_~j~0_6 (* v_ULTIMATE.start_main_~length~0_11 v_ULTIMATE.start_main_~fac~0_8)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} AuxVars[] AssignedVars[] 923#L17 [481] L17-->L17-1: Formula: (let ((.cse2 (mod v_ULTIMATE.start_main_~i~0_11 v_ULTIMATE.start_main_~length~0_12))) (let ((.cse1 (* 4 v_ULTIMATE.start_main_~length~0_12)) (.cse0 (* 4 .cse2))) (and (<= (+ v_ULTIMATE.start_main_~arr~0.offset_7 .cse0 4) (+ (select |v_#length_6| v_ULTIMATE.start_main_~arr~0.base_8) .cse1)) (> .cse2 0) (< v_ULTIMATE.start_main_~i~0_11 0) (>= v_ULTIMATE.start_main_~length~0_12 0) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~arr~0.base_8) (+ v_ULTIMATE.start_main_~arr~0.offset_7 .cse0 (* (- 4) v_ULTIMATE.start_main_~length~0_12)))) (<= .cse1 (+ v_ULTIMATE.start_main_~arr~0.offset_7 .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~arr~0.base_8))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_7, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_8, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_8, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 924#L17-1 [1509] L17-1-->L16-3: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~j~0_16))) (let ((.cse0 (+ v_ULTIMATE.start_main_~arr2~0.offset_9 .cse1))) (and (= 1 (select |v_#valid_25| v_ULTIMATE.start_main_~arr2~0.base_10)) (<= 0 .cse0) (= (store |v_#memory_int_13| v_ULTIMATE.start_main_~arr2~0.base_10 (store (select |v_#memory_int_13| v_ULTIMATE.start_main_~arr2~0.base_10) .cse0 |v_ULTIMATE.start_main_#t~mem7_9|)) |v_#memory_int_12|) (= (+ v_ULTIMATE.start_main_~j~0_16 1) v_ULTIMATE.start_main_~j~0_15) (<= (+ v_ULTIMATE.start_main_~arr2~0.offset_9 .cse1 4) (select |v_#length_13| v_ULTIMATE.start_main_~arr2~0.base_10))))) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_9|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_10, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_9} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_8|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_12|, #length=|v_#length_13|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_10, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~j~0, #memory_int, ULTIMATE.start_main_#t~post6] 926#L16-3 [2020-06-22 10:37:53,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:53,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1876782086, now seen corresponding path program 1 times [2020-06-22 10:37:53,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:53,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:53,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:53,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:53,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:53,336 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:53,336 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:53,336 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:53,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:53,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 10:37:53,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:53,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:37:53,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:37:53,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:37:53,391 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 10:37:53,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:53,391 INFO L82 PathProgramCache]: Analyzing trace with hash 120208, now seen corresponding path program 1 times [2020-06-22 10:37:53,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:53,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:53,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:53,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:53,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:53,393 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:53,393 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:53,393 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:53,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:53,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:37:53,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:37:53,506 INFO L87 Difference]: Start difference. First operand 24 states and 59 transitions. cyclomatic complexity: 40 Second operand 4 states. [2020-06-22 10:37:53,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:37:53,565 INFO L93 Difference]: Finished difference Result 29 states and 56 transitions. [2020-06-22 10:37:53,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:37:53,660 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 56 transitions. [2020-06-22 10:37:53,661 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2020-06-22 10:37:53,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 56 transitions. [2020-06-22 10:37:53,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-06-22 10:37:53,661 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-06-22 10:37:53,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 56 transitions. [2020-06-22 10:37:53,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:37:53,662 INFO L706 BuchiCegarLoop]: Abstraction has 29 states and 56 transitions. [2020-06-22 10:37:53,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 56 transitions. [2020-06-22 10:37:53,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 15. [2020-06-22 10:37:53,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-06-22 10:37:53,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 26 transitions. [2020-06-22 10:37:53,663 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 26 transitions. [2020-06-22 10:37:53,664 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 26 transitions. [2020-06-22 10:37:53,664 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2020-06-22 10:37:53,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 26 transitions. [2020-06-22 10:37:53,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 10:37:53,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:37:53,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:37:53,665 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:37:53,665 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:37:53,665 INFO L794 eck$LassoCheckResult]: Stem: 990#ULTIMATE.startENTRY [1502] ULTIMATE.startENTRY-->L7: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_18| (store |v_#valid_19| 0 0))) InVars {#valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_9, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_9, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_7|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_8, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_7|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_7|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_18|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet5, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~fac~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~arr2~0.base, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~arr2~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 991#L7 [97] L7-->L7-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 987#L7-2 [64] L7-2-->L9: Formula: (= v_ULTIMATE.start_main_~fac~0_2 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~fac~0] 988#L9 [68] L9-->L9-2: Formula: (and (= v_ULTIMATE.start_main_~fac~0_3 1) (< v_ULTIMATE.start_main_~fac~0_4 1)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_4} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~fac~0] 994#L9-2 [112] L9-2-->L12: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr2~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc2.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 (* v_ULTIMATE.start_main_~fac~0_6 v_ULTIMATE.start_main_~length~0_7)))) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (< |v_ULTIMATE.start_main_#t~malloc2.base_2| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~arr~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= v_ULTIMATE.start_main_~arr2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_2, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_2, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_2, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_2|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, #valid, #length, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_~arr2~0.base, ULTIMATE.start_main_~arr2~0.offset] 995#L12 [130] L12-->L13-3: Formula: (and (= v_ULTIMATE.start_main_~i~0_4 0) (< v_ULTIMATE.start_main_~arr~0.base_4 0) (< v_ULTIMATE.start_main_~arr2~0.base_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 983#L13-3 [94] L13-3-->L14: Formula: (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} AuxVars[] AssignedVars[] 984#L14 [1506] L14-->L13-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_17))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_13)) (= (store |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13) .cse1 |v_ULTIMATE.start_main_#t~nondet5_8|)) |v_#memory_int_8|) (= (+ v_ULTIMATE.start_main_~i~0_17 1) v_ULTIMATE.start_main_~i~0_16) (<= 0 .cse1) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~arr~0.base_13))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, #length=|v_#length_11|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post4] 985#L13-3 [1504] L13-3-->L16-3: Formula: (and (= 0 v_ULTIMATE.start_main_~j~0_12) (<= v_ULTIMATE.start_main_~length~0_15 v_ULTIMATE.start_main_~i~0_14)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 986#L16-3 [2020-06-22 10:37:53,666 INFO L796 eck$LassoCheckResult]: Loop: 986#L16-3 [77] L16-3-->L17: Formula: (< v_ULTIMATE.start_main_~j~0_6 (* v_ULTIMATE.start_main_~length~0_11 v_ULTIMATE.start_main_~fac~0_8)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} AuxVars[] AssignedVars[] 992#L17 [481] L17-->L17-1: Formula: (let ((.cse2 (mod v_ULTIMATE.start_main_~i~0_11 v_ULTIMATE.start_main_~length~0_12))) (let ((.cse1 (* 4 v_ULTIMATE.start_main_~length~0_12)) (.cse0 (* 4 .cse2))) (and (<= (+ v_ULTIMATE.start_main_~arr~0.offset_7 .cse0 4) (+ (select |v_#length_6| v_ULTIMATE.start_main_~arr~0.base_8) .cse1)) (> .cse2 0) (< v_ULTIMATE.start_main_~i~0_11 0) (>= v_ULTIMATE.start_main_~length~0_12 0) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~arr~0.base_8) (+ v_ULTIMATE.start_main_~arr~0.offset_7 .cse0 (* (- 4) v_ULTIMATE.start_main_~length~0_12)))) (<= .cse1 (+ v_ULTIMATE.start_main_~arr~0.offset_7 .cse0)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~arr~0.base_8))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_7, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_8, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_8, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 989#L17-1 [1509] L17-1-->L16-3: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~j~0_16))) (let ((.cse0 (+ v_ULTIMATE.start_main_~arr2~0.offset_9 .cse1))) (and (= 1 (select |v_#valid_25| v_ULTIMATE.start_main_~arr2~0.base_10)) (<= 0 .cse0) (= (store |v_#memory_int_13| v_ULTIMATE.start_main_~arr2~0.base_10 (store (select |v_#memory_int_13| v_ULTIMATE.start_main_~arr2~0.base_10) .cse0 |v_ULTIMATE.start_main_#t~mem7_9|)) |v_#memory_int_12|) (= (+ v_ULTIMATE.start_main_~j~0_16 1) v_ULTIMATE.start_main_~j~0_15) (<= (+ v_ULTIMATE.start_main_~arr2~0.offset_9 .cse1 4) (select |v_#length_13| v_ULTIMATE.start_main_~arr2~0.base_10))))) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_9|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_10, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_9} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_8|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_12|, #length=|v_#length_13|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_10, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~j~0, #memory_int, ULTIMATE.start_main_#t~post6] 986#L16-3 [2020-06-22 10:37:53,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:53,666 INFO L82 PathProgramCache]: Analyzing trace with hash -299986494, now seen corresponding path program 1 times [2020-06-22 10:37:53,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:53,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:53,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:53,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:53,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:53,669 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:53,669 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:53,669 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:53,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:53,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:53,736 INFO L82 PathProgramCache]: Analyzing trace with hash 120208, now seen corresponding path program 2 times [2020-06-22 10:37:53,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:53,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:53,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:53,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:53,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:53,738 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:53,738 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:53,738 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:53,749 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 10:37:53,758 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-06-22 10:37:53,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2020-06-22 10:37:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:53,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:53,790 INFO L82 PathProgramCache]: Analyzing trace with hash 929390639, now seen corresponding path program 1 times [2020-06-22 10:37:53,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:53,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:53,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:53,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:37:53,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:53,793 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:53,793 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:53,793 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:53,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:53,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 10:37:53,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:53,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:37:53,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:37:53,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 10:37:53,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:37:53,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:37:53,928 INFO L87 Difference]: Start difference. First operand 15 states and 26 transitions. cyclomatic complexity: 13 Second operand 4 states. [2020-06-22 10:37:53,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:37:53,967 INFO L93 Difference]: Finished difference Result 16 states and 26 transitions. [2020-06-22 10:37:53,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:37:54,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 26 transitions. [2020-06-22 10:37:54,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 10:37:54,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 26 transitions. [2020-06-22 10:37:54,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-06-22 10:37:54,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-06-22 10:37:54,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 26 transitions. [2020-06-22 10:37:54,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:37:54,091 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 26 transitions. [2020-06-22 10:37:54,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 26 transitions. [2020-06-22 10:37:54,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-06-22 10:37:54,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-06-22 10:37:54,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 25 transitions. [2020-06-22 10:37:54,092 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 25 transitions. [2020-06-22 10:37:54,092 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 25 transitions. [2020-06-22 10:37:54,092 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2020-06-22 10:37:54,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 25 transitions. [2020-06-22 10:37:54,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 10:37:54,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:37:54,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:37:54,093 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:37:54,094 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 10:37:54,094 INFO L794 eck$LassoCheckResult]: Stem: 1062#ULTIMATE.startENTRY [1502] ULTIMATE.startENTRY-->L7: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_18| (store |v_#valid_19| 0 0))) InVars {#valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_4|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_9, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_9, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_7|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_8, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_11, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_11, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_7|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_7|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, #valid=|v_#valid_18|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet5, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~fac~0, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~arr2~0.base, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~arr2~0.offset, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length~0] 1063#L7 [97] L7-->L7-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 1060#L7-2 [64] L7-2-->L9: Formula: (= v_ULTIMATE.start_main_~fac~0_2 |v_ULTIMATE.start_main_#t~nondet1_3|) InVars {ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_3|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_2|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~fac~0] 1061#L9 [68] L9-->L9-2: Formula: (and (= v_ULTIMATE.start_main_~fac~0_3 1) (< v_ULTIMATE.start_main_~fac~0_4 1)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_4} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~fac~0] 1067#L9-2 [112] L9-2-->L12: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_2|) (= v_ULTIMATE.start_main_~arr2~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc2.base_2| (* 4 v_ULTIMATE.start_main_~length~0_7)) |v_ULTIMATE.start_main_#t~malloc3.base_2| (* 4 (* v_ULTIMATE.start_main_~fac~0_6 v_ULTIMATE.start_main_~length~0_7)))) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (< |v_ULTIMATE.start_main_#t~malloc2.base_2| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~arr~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_2|) (= v_ULTIMATE.start_main_~arr2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc2.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_2, ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_6, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_2, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_2, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_2|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_2|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#t~malloc3.base, #valid, #length, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_~arr2~0.base, ULTIMATE.start_main_~arr2~0.offset] 1068#L12 [130] L12-->L13-3: Formula: (and (= v_ULTIMATE.start_main_~i~0_4 0) (< v_ULTIMATE.start_main_~arr~0.base_4 0) (< v_ULTIMATE.start_main_~arr2~0.base_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_4, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1056#L13-3 [94] L13-3-->L14: Formula: (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9} AuxVars[] AssignedVars[] 1057#L14 [1506] L14-->L13-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_17))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_11 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_13)) (= (store |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_13) .cse1 |v_ULTIMATE.start_main_#t~nondet5_8|)) |v_#memory_int_8|) (= (+ v_ULTIMATE.start_main_~i~0_17 1) v_ULTIMATE.start_main_~i~0_16) (<= 0 .cse1) (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~arr~0.base_13))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_17, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_11, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_13, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_16, #length=|v_#length_11|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5, #memory_int, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post4] 1058#L13-3 [1504] L13-3-->L16-3: Formula: (and (= 0 v_ULTIMATE.start_main_~j~0_12) (<= v_ULTIMATE.start_main_~length~0_15 v_ULTIMATE.start_main_~i~0_14)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_15} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_12, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 1059#L16-3 [2020-06-22 10:37:54,094 INFO L796 eck$LassoCheckResult]: Loop: 1059#L16-3 [77] L16-3-->L17: Formula: (< v_ULTIMATE.start_main_~j~0_6 (* v_ULTIMATE.start_main_~length~0_11 v_ULTIMATE.start_main_~fac~0_8)) InVars {ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_main_~fac~0=v_ULTIMATE.start_main_~fac~0_8, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} AuxVars[] AssignedVars[] 1065#L17 [1379] L17-->L17-1: Formula: (let ((.cse2 (mod v_ULTIMATE.start_main_~i~0_11 v_ULTIMATE.start_main_~length~0_12))) (let ((.cse1 (* 4 .cse2))) (let ((.cse0 (+ v_ULTIMATE.start_main_~arr~0.offset_7 .cse1))) (and (<= 0 .cse0) (>= v_ULTIMATE.start_main_~length~0_12 0) (<= (+ v_ULTIMATE.start_main_~arr~0.offset_7 .cse1 4) (select |v_#length_6| v_ULTIMATE.start_main_~arr~0.base_8)) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~arr~0.base_8) .cse0) |v_ULTIMATE.start_main_#t~mem7_2|) (= .cse2 0) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~arr~0.base_8)))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_7, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_8, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_7, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_8, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 1064#L17-1 [1509] L17-1-->L16-3: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_main_~j~0_16))) (let ((.cse0 (+ v_ULTIMATE.start_main_~arr2~0.offset_9 .cse1))) (and (= 1 (select |v_#valid_25| v_ULTIMATE.start_main_~arr2~0.base_10)) (<= 0 .cse0) (= (store |v_#memory_int_13| v_ULTIMATE.start_main_~arr2~0.base_10 (store (select |v_#memory_int_13| v_ULTIMATE.start_main_~arr2~0.base_10) .cse0 |v_ULTIMATE.start_main_#t~mem7_9|)) |v_#memory_int_12|) (= (+ v_ULTIMATE.start_main_~j~0_16 1) v_ULTIMATE.start_main_~j~0_15) (<= (+ v_ULTIMATE.start_main_~arr2~0.offset_9 .cse1 4) (select |v_#length_13| v_ULTIMATE.start_main_~arr2~0.base_10))))) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_9|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_10, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_9} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_8|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_12|, #length=|v_#length_13|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_~arr2~0.base=v_ULTIMATE.start_main_~arr2~0.base_10, ULTIMATE.start_main_~arr2~0.offset=v_ULTIMATE.start_main_~arr2~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~j~0, #memory_int, ULTIMATE.start_main_#t~post6] 1059#L16-3 [2020-06-22 10:37:54,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:54,095 INFO L82 PathProgramCache]: Analyzing trace with hash -299986494, now seen corresponding path program 2 times [2020-06-22 10:37:54,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:54,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:54,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:54,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:54,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:54,097 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:54,097 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:54,098 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:54,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 10:37:54,120 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 10:37:54,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2020-06-22 10:37:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:54,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:54,156 INFO L82 PathProgramCache]: Analyzing trace with hash 148046, now seen corresponding path program 1 times [2020-06-22 10:37:54,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:54,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:54,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:54,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:37:54,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:54,158 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:54,158 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:54,158 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:54,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:54,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:54,207 INFO L82 PathProgramCache]: Analyzing trace with hash 929418477, now seen corresponding path program 1 times [2020-06-22 10:37:54,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:37:54,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:37:54,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:54,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:54,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:37:54,209 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2020-06-22 10:37:54,210 INFO L258 seRefinementStrategy]: Advancing trace checker [2020-06-22 10:37:54,210 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-06-22 10:37:54,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:37:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:37:54,491 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2020-06-22 10:37:54,551 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:37:54,586 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:37:54,587 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:37:54,587 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:37:54,587 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:37:54,587 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:37:54,587 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:37:54,587 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:37:54,587 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration15_Lasso [2020-06-22 10:37:54,587 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:37:54,587 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:37:54,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:54,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:54,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:54,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:54,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:54,801 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2020-06-22 10:37:54,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:54,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:54,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:54,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:54,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:37:55,115 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2020-06-22 10:37:55,225 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2020-06-22 10:37:55,394 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:37:55,395 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:37:55,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:55,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:55,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:37:55,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:55,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:55,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:55,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:37:55,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:37:55,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:55,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:55,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:55,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:37:55,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:55,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:55,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:55,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:37:55,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:37:55,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:55,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:55,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:55,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:37:55,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:55,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:55,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:55,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:37:55,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:37:55,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:55,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:55,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:55,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:55,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:55,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:55,402 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:37:55,402 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:37:55,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:55,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:55,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:55,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:55,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:55,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:55,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:37:55,406 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:37:55,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:55,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:55,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:55,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:37:55,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:55,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:55,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:55,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:37:55,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:37:55,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:55,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:55,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:55,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:55,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:55,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:55,411 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:37:55,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:37:55,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:55,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:55,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:55,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:55,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:55,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:55,418 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:37:55,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:37:55,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:55,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:55,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:55,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:55,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:55,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:55,430 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:37:55,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:37:55,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:55,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:55,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:55,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:55,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:55,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:55,435 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:37:55,435 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:37:55,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:55,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:55,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:55,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:55,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:55,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:55,438 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:37:55,438 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:37:55,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:37:55,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:37:55,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:37:55,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:37:55,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:37:55,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:37:55,445 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:37:55,445 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:37:55,466 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:37:55,486 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-06-22 10:37:55,487 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 10:37:55,487 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:37:55,488 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:37:55,488 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:37:55,488 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_~arr2~0.base)_1, ULTIMATE.start_main_~arr2~0.offset) = -4*ULTIMATE.start_main_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_~arr2~0.base)_1 - 1*ULTIMATE.start_main_~arr2~0.offset Supporting invariants [] [2020-06-22 10:37:55,522 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-06-22 10:37:55,523 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:55,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:37:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:55,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:37:55,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:55,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:37:55,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:55,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:37:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:37:55,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:37:55,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:37:55,584 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 10:37:55,584 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-06-22 10:37:55,584 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 15 states and 25 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-06-22 10:37:55,635 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 15 states and 25 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 18 states and 33 transitions. Complement of second has 4 states. [2020-06-22 10:37:55,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 10:37:55,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 10:37:55,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2020-06-22 10:37:55,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 9 letters. Loop has 3 letters. [2020-06-22 10:37:55,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:37:55,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 12 letters. Loop has 3 letters. [2020-06-22 10:37:55,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:37:55,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 9 letters. Loop has 6 letters. [2020-06-22 10:37:55,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:37:55,759 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 33 transitions. [2020-06-22 10:37:55,760 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:37:55,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2020-06-22 10:37:55,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:37:55,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:37:55,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:37:55,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:37:55,760 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:37:55,760 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:37:55,761 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:37:55,761 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2020-06-22 10:37:55,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:37:55,761 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:37:55,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:37:55,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:37:55 BasicIcfg [2020-06-22 10:37:55,767 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:37:55,767 INFO L168 Benchmark]: Toolchain (without parser) took 120284.15 ms. Allocated memory was 649.6 MB in the beginning and 1.1 GB in the end (delta: 424.1 MB). Free memory was 563.8 MB in the beginning and 960.0 MB in the end (delta: -396.2 MB). Peak memory consumption was 27.9 MB. Max. memory is 50.3 GB. [2020-06-22 10:37:55,768 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.7 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:37:55,768 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.94 ms. Allocated memory was 649.6 MB in the beginning and 678.4 MB in the end (delta: 28.8 MB). Free memory was 563.8 MB in the beginning and 642.5 MB in the end (delta: -78.7 MB). Peak memory consumption was 29.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:37:55,769 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.94 ms. Allocated memory is still 678.4 MB. Free memory was 641.5 MB in the beginning and 640.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:37:55,769 INFO L168 Benchmark]: Boogie Preprocessor took 25.48 ms. Allocated memory is still 678.4 MB. Free memory was 640.4 MB in the beginning and 638.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:37:55,770 INFO L168 Benchmark]: RCFGBuilder took 295.79 ms. Allocated memory is still 678.4 MB. Free memory was 638.2 MB in the beginning and 617.1 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 50.3 GB. [2020-06-22 10:37:55,770 INFO L168 Benchmark]: BlockEncodingV2 took 73428.90 ms. Allocated memory is still 678.4 MB. Free memory was 617.1 MB in the beginning and 401.7 MB in the end (delta: 215.5 MB). Peak memory consumption was 215.5 MB. Max. memory is 50.3 GB. [2020-06-22 10:37:55,771 INFO L168 Benchmark]: TraceAbstraction took 36594.01 ms. Allocated memory was 678.4 MB in the beginning and 834.1 MB in the end (delta: 155.7 MB). Free memory was 401.7 MB in the beginning and 664.5 MB in the end (delta: -262.9 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:37:55,771 INFO L168 Benchmark]: BuchiAutomizer took 9578.47 ms. Allocated memory was 834.1 MB in the beginning and 1.1 GB in the end (delta: 239.6 MB). Free memory was 664.5 MB in the beginning and 960.0 MB in the end (delta: -295.5 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:37:55,774 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 27 locations, 33 edges - StatisticsResult: Encoded RCFG 17 locations, 1401 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.7 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 314.94 ms. Allocated memory was 649.6 MB in the beginning and 678.4 MB in the end (delta: 28.8 MB). Free memory was 563.8 MB in the beginning and 642.5 MB in the end (delta: -78.7 MB). Peak memory consumption was 29.1 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.94 ms. Allocated memory is still 678.4 MB. Free memory was 641.5 MB in the beginning and 640.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.48 ms. Allocated memory is still 678.4 MB. Free memory was 640.4 MB in the beginning and 638.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 295.79 ms. Allocated memory is still 678.4 MB. Free memory was 638.2 MB in the beginning and 617.1 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 73428.90 ms. Allocated memory is still 678.4 MB. Free memory was 617.1 MB in the beginning and 401.7 MB in the end (delta: 215.5 MB). Peak memory consumption was 215.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 36594.01 ms. Allocated memory was 678.4 MB in the beginning and 834.1 MB in the end (delta: 155.7 MB). Free memory was 401.7 MB in the beginning and 664.5 MB in the end (delta: -262.9 MB). There was no memory consumed. Max. memory is 50.3 GB. * BuchiAutomizer took 9578.47 ms. Allocated memory was 834.1 MB in the beginning and 1.1 GB in the end (delta: 239.6 MB). Free memory was 664.5 MB in the beginning and 960.0 MB in the end (delta: -295.5 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~fac~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~fac~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~fac~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~fac~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant [2020-06-22 10:37:55,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] [2020-06-22 10:37:55,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] [2020-06-22 10:37:55,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:55,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:55,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 10:37:55,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 10:37:55,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~fac~0,QUANTIFIED] [2020-06-22 10:37:55,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 10:37:55,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:55,785 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:55,785 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:55,785 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:55,785 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:55,786 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:55,786 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:55,786 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] [2020-06-22 10:37:55,787 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] [2020-06-22 10:37:55,787 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:55,787 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:55,787 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 10:37:55,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 10:37:55,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~fac~0,QUANTIFIED] [2020-06-22 10:37:55,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 10:37:55,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:55,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:55,789 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:55,789 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:55,789 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:55,789 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:55,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((4 * length == unknown-#length-unknown[arr] && (\exists v_ULTIMATE.start_main_~i~0_20 : int :: i <= v_ULTIMATE.start_main_~i~0_20 + 1 && 4 * v_ULTIMATE.start_main_~i~0_20 + arr + 4 <= unknown-#length-unknown[arr])) && (\exists ULTIMATE.start_main_#t~malloc3.base : int :: !(arr == ULTIMATE.start_main_#t~malloc3.base) && 1 == \valid[ULTIMATE.start_main_#t~malloc3.base])) && 1 == \valid[arr2]) && 4 * (fac * length) == unknown-#length-unknown[arr2]) && \valid[arr] == 1) && arr <= 0) && arr2 <= 0) && 0 <= arr) && 0 <= arr2) && (\exists ULTIMATE.start_main_#t~malloc3.base : int, ULTIMATE.start_main_~fac~0 : int, ULTIMATE.start_main_~length~0 : int :: ((1 <= ULTIMATE.start_main_~length~0 && 4 * ULTIMATE.start_main_~length~0 == unknown-#length-unknown[arr]) && 4 * (ULTIMATE.start_main_~fac~0 * ULTIMATE.start_main_~length~0) == unknown-#length-unknown[ULTIMATE.start_main_#t~malloc3.base]) && !(arr == ULTIMATE.start_main_#t~malloc3.base))) && 0 <= i - InvariantResult [Line: 16]: Loop Invariant [2020-06-22 10:37:55,790 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:55,790 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:55,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] [2020-06-22 10:37:55,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] [2020-06-22 10:37:55,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 10:37:55,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 10:37:55,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~fac~0,QUANTIFIED] [2020-06-22 10:37:55,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 10:37:55,792 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:55,792 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:55,792 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:55,792 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:55,793 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:55,793 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:55,793 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:55,793 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:55,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:55,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] [2020-06-22 10:37:55,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_20,QUANTIFIED] [2020-06-22 10:37:55,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 10:37:55,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 10:37:55,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~fac~0,QUANTIFIED] [2020-06-22 10:37:55,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length~0,QUANTIFIED] [2020-06-22 10:37:55,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:55,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_#t~malloc3.base,QUANTIFIED] [2020-06-22 10:37:55,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:55,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:55,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:55,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:37:55,796 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((4 * length == unknown-#length-unknown[arr] && length <= i) && (\exists ULTIMATE.start_main_#t~malloc3.base : int :: !(arr == ULTIMATE.start_main_#t~malloc3.base) && 1 == \valid[ULTIMATE.start_main_#t~malloc3.base])) && (\exists v_ULTIMATE.start_main_~i~0_20 : int :: i <= v_ULTIMATE.start_main_~i~0_20 + 1 && 4 * v_ULTIMATE.start_main_~i~0_20 + arr + 4 <= unknown-#length-unknown[arr])) && 1 == \valid[arr2]) && 4 * (fac * length) == unknown-#length-unknown[arr2]) && \valid[arr] == 1) && arr2 <= 0) && 0 <= arr) && 0 <= j) && 0 <= arr2) && (\exists ULTIMATE.start_main_#t~malloc3.base : int, ULTIMATE.start_main_~fac~0 : int, ULTIMATE.start_main_~length~0 : int :: ((1 <= ULTIMATE.start_main_~length~0 && 4 * ULTIMATE.start_main_~length~0 == unknown-#length-unknown[arr]) && 4 * (ULTIMATE.start_main_~fac~0 * ULTIMATE.start_main_~length~0) == unknown-#length-unknown[ULTIMATE.start_main_#t~malloc3.base]) && !(arr == ULTIMATE.start_main_#t~malloc3.base)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 6 error locations. SAFE Result, 36.4s OverallTime, 15 OverallIterations, 2 TraceHistogramMax, 29.4s AutomataDifference, 0.0s DeadEndRemovalTime, 5.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 90 SDtfs, 558 SDslu, 147 SDs, 0 SdLazy, 797 SolverSat, 1441 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 23.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 25 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 7 NumberOfFragments, 190 HoareAnnotationTreeSize, 2 FomulaSimplifications, 644 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 142 FormulaSimplificationTreeSizeReductionInter, 5.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 130 ConstructedInterpolants, 19 QuantifiedInterpolants, 7342 SizeOfPredicates, 32 NumberOfNonLiveVariables, 724 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 15 InterpolantComputations, 13 PerfectInterpolantSequences, 8/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 15 terminating modules (10 trivial, 0 deterministic, 5 nondeterministic). One nondeterministic module has affine ranking function -1 * arr + -4 * i + unknown-#length-unknown[arr] and consists of 3 locations. One nondeterministic module has affine ranking function -1 * arr + unknown-#length-unknown[arr] + -4 * i and consists of 3 locations. One nondeterministic module has affine ranking function -1 * i + length and consists of 5 locations. One nondeterministic module has affine ranking function -1 * i + length and consists of 5 locations. One nondeterministic module has affine ranking function -4 * j + unknown-#length-unknown[arr2] + -1 * arr2 and consists of 3 locations. 10 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.5s and 16 iterations. TraceHistogramMax:1. Analysis of lassos took 5.9s. Construction of modules took 1.7s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 15. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 60 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 11. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 129 SDtfs, 463 SDslu, 110 SDs, 0 SdLazy, 712 SolverSat, 1393 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU9 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital149 mio100 ax100 hnf100 lsp92 ukn81 mio100 lsp61 div111 bol100 ite100 ukn100 eq172 hnf91 smp94 dnf99 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 10:35:52.274 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 10:37:56.022 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check