./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/array16_alloca_original.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/array16_alloca_original.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b6c8e92f4d5413ae33bafe73b9024f19a73a1964 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:38:38,593 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:38:38,595 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:38:38,607 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:38:38,608 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:38:38,609 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:38:38,610 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:38:38,612 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:38:38,614 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:38:38,615 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:38:38,616 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:38:38,617 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:38:38,618 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:38:38,619 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:38:38,620 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:38:38,622 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:38:38,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:38:38,624 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:38:38,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:38:38,628 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:38:38,629 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:38:38,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:38:38,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:38:38,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:38:38,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:38:38,636 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:38:38,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:38:38,637 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:38:38,638 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:38:38,639 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:38:38,639 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:38:38,640 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:38:38,641 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:38:38,641 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:38:38,643 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:38:38,643 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:38:38,644 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:38:38,644 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:38:38,644 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:38:38,645 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:38:38,646 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:38:38,647 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:38:38,664 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:38:38,665 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:38:38,666 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:38:38,666 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:38:38,666 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:38:38,667 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:38:38,667 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:38:38,667 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:38:38,668 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:38:38,668 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:38:38,668 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:38:38,668 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:38:38,669 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:38:38,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:38:38,669 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:38:38,669 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:38:38,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:38:38,670 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:38:38,670 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:38:38,671 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:38:38,671 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:38:38,671 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:38:38,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:38:38,672 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:38:38,672 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:38:38,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:38:38,673 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:38:38,673 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:38:38,673 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:38:38,674 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:38:38,674 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b6c8e92f4d5413ae33bafe73b9024f19a73a1964 [2020-07-29 01:38:38,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:38:39,001 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:38:39,005 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:38:39,006 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:38:39,007 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:38:39,008 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array16_alloca_original.i [2020-07-29 01:38:39,081 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7b194c8/db47d64405044bb780af9ae43b64806f/FLAG6746ae9ef [2020-07-29 01:38:39,669 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:38:39,669 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array16_alloca_original.i [2020-07-29 01:38:39,678 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7b194c8/db47d64405044bb780af9ae43b64806f/FLAG6746ae9ef [2020-07-29 01:38:39,927 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7b194c8/db47d64405044bb780af9ae43b64806f [2020-07-29 01:38:39,931 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:38:39,934 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:38:39,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:38:39,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:38:39,939 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:38:39,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:38:39" (1/1) ... [2020-07-29 01:38:39,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64cd5698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:39, skipping insertion in model container [2020-07-29 01:38:39,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:38:39" (1/1) ... [2020-07-29 01:38:39,953 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:38:39,993 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:38:40,402 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:38:40,417 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:38:40,500 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:38:40,564 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:38:40,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:40 WrapperNode [2020-07-29 01:38:40,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:38:40,566 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:38:40,566 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:38:40,566 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:38:40,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:40" (1/1) ... [2020-07-29 01:38:40,590 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:40" (1/1) ... [2020-07-29 01:38:40,616 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:38:40,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:38:40,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:38:40,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:38:40,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:40" (1/1) ... [2020-07-29 01:38:40,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:40" (1/1) ... [2020-07-29 01:38:40,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:40" (1/1) ... [2020-07-29 01:38:40,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:40" (1/1) ... [2020-07-29 01:38:40,637 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:40" (1/1) ... [2020-07-29 01:38:40,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:40" (1/1) ... [2020-07-29 01:38:40,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:40" (1/1) ... [2020-07-29 01:38:40,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:38:40,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:38:40,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:38:40,648 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:38:40,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:40,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:38:40,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:38:40,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:38:40,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:38:40,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:38:40,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:38:41,127 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:38:41,127 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-29 01:38:41,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:38:41 BoogieIcfgContainer [2020-07-29 01:38:41,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:38:41,131 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:38:41,131 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:38:41,135 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:38:41,136 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:38:41,136 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:38:39" (1/3) ... [2020-07-29 01:38:41,137 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c035bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:38:41, skipping insertion in model container [2020-07-29 01:38:41,137 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:38:41,137 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:40" (2/3) ... [2020-07-29 01:38:41,138 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c035bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:38:41, skipping insertion in model container [2020-07-29 01:38:41,138 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:38:41,138 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:38:41" (3/3) ... [2020-07-29 01:38:41,140 INFO L371 chiAutomizerObserver]: Analyzing ICFG array16_alloca_original.i [2020-07-29 01:38:41,189 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:38:41,189 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:38:41,190 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:38:41,190 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:38:41,192 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:38:41,192 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:38:41,192 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:38:41,192 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:38:41,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 01:38:41,229 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:38:41,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:41,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:41,235 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:38:41,235 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:38:41,235 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:38:41,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 01:38:41,238 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:38:41,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:41,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:41,239 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:38:41,239 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:38:41,245 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 16#L367true assume !(main_~length~0 < 1); 5#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 12#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 17#L370-3true [2020-07-29 01:38:41,246 INFO L796 eck$LassoCheckResult]: Loop: 17#L370-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 9#L372true assume 1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2);havoc main_#t~mem209;call write~int(0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 14#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 17#L370-3true [2020-07-29 01:38:41,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:41,254 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2020-07-29 01:38:41,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:41,267 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068253018] [2020-07-29 01:38:41,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:41,362 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:41,375 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:41,396 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:41,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:41,398 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2020-07-29 01:38:41,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:41,399 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860889210] [2020-07-29 01:38:41,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:41,420 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:41,439 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:41,443 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:41,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:41,447 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2020-07-29 01:38:41,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:41,449 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700029871] [2020-07-29 01:38:41,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:41,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:41,495 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:41,517 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:41,523 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:41,867 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:38:41,867 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:38:41,868 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:38:41,868 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:38:41,868 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:38:41,868 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:41,868 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:38:41,869 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:38:41,869 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration1_Lasso [2020-07-29 01:38:41,869 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:38:41,869 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:38:41,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:41,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:41,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:41,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:41,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:41,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:41,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:41,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:41,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:41,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:42,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:42,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:42,668 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:38:42,675 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:42,681 INFO L120 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-07-29 01:38:42,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:42,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:42,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:42,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:42,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:42,689 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:42,689 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:42,692 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:42,734 INFO L120 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-07-29 01:38:42,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:42,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:42,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:42,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:42,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:42,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:42,738 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:42,740 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:42,778 INFO L120 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-07-29 01:38:42,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:42,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:42,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:42,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:42,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:42,782 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:42,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:42,785 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:42,821 INFO L120 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-07-29 01:38:42,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:42,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:42,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:42,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:42,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:42,825 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:42,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:42,827 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:42,860 INFO L120 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-07-29 01:38:42,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:42,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:42,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:42,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:42,867 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:42,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:42,872 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:42,908 INFO L120 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-07-29 01:38:42,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:42,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:42,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:42,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:42,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:42,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:42,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:42,914 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:42,945 INFO L120 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-07-29 01:38:42,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:42,947 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:42,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:42,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:42,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:42,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:42,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:42,950 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:42,977 INFO L120 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-07-29 01:38:42,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:42,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:42,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:42,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:42,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:42,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:42,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:42,984 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:43,013 INFO L120 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-07-29 01:38:43,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:43,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:43,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:43,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:43,023 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:43,023 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:43,029 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:43,074 INFO L120 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-07-29 01:38:43,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:43,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:43,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:43,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:43,095 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:43,096 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:43,117 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:38:43,149 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-07-29 01:38:43,149 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:43,167 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:38:43,203 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:38:43,204 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:38:43,205 INFO L512 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-07-29 01:38:43,266 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 01:38:43,272 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);" "assume 1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2);havoc main_#t~mem209;call write~int(0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);" "main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207;" [2020-07-29 01:38:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:43,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:43,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:38:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:43,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:43,353 INFO L280 TraceCheckUtils]: 0: Hoare triple {25#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {25#unseeded} is VALID [2020-07-29 01:38:43,354 INFO L280 TraceCheckUtils]: 1: Hoare triple {25#unseeded} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {25#unseeded} is VALID [2020-07-29 01:38:43,355 INFO L280 TraceCheckUtils]: 2: Hoare triple {25#unseeded} assume !(main_~length~0 < 1); {25#unseeded} is VALID [2020-07-29 01:38:43,356 INFO L280 TraceCheckUtils]: 3: Hoare triple {25#unseeded} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {25#unseeded} is VALID [2020-07-29 01:38:43,357 INFO L280 TraceCheckUtils]: 4: Hoare triple {25#unseeded} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {25#unseeded} is VALID [2020-07-29 01:38:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:43,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:38:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:43,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:43,399 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~length~0))} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {70#(and (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~length~0))} is VALID [2020-07-29 01:38:43,401 INFO L280 TraceCheckUtils]: 1: Hoare triple {70#(and (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~length~0))} assume 1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2);havoc main_#t~mem209;call write~int(0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {70#(and (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~length~0))} is VALID [2020-07-29 01:38:43,403 INFO L280 TraceCheckUtils]: 2: Hoare triple {70#(and (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~length~0))} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {53#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~length~0))) unseeded)} is VALID [2020-07-29 01:38:43,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:38:43,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:38:43,428 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:38:43,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:38:43,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,461 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:38:43,465 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2020-07-29 01:38:43,639 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 35 states and 50 transitions. Complement of second has 7 states. [2020-07-29 01:38:43,640 INFO L141 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-07-29 01:38:43,640 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:43,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 01:38:43,646 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:38:43,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:43,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:43,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:38:43,662 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:38:43,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:43,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:43,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 50 transitions. [2020-07-29 01:38:43,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:43,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:43,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:43,671 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states. [2020-07-29 01:38:43,674 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:38:43,678 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:38:43,678 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:38:43,683 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:38:43,684 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:38:43,684 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 35 states and 50 transitions. cyclomatic complexity: 19 [2020-07-29 01:38:43,686 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:38:43,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:38:43,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:38:43,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:38:43,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:43,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:43,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:43,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:38:43,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:38:43,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:38:43,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:38:43,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:38:43,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:38:43,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:38:43,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:38:43,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:38:43,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:38:43,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:38:43,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:38:43,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:38:43,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:38:43,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:38:43,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:38:43,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:38:43,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:38:43,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:38:43,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:38:43,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:38:43,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:38:43,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:38:43,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:38:43,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:38:43,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:38:43,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:38:43,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:38:43,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:38:43,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:38:43,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:43,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:43,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:43,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:38:43,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:38:43,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:38:43,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:38:43,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:38:43,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:38:43,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,723 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:43,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:38:43,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-29 01:38:43,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:38:43,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:38:43,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2020-07-29 01:38:43,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:43,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. cyclomatic complexity: 19 [2020-07-29 01:38:43,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:43,753 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2020-07-29 01:38:43,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 01:38:43,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 01:38:43,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2020-07-29 01:38:43,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:38:43,758 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-07-29 01:38:43,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2020-07-29 01:38:43,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-29 01:38:43,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:38:43,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 17 transitions. Second operand 12 states. [2020-07-29 01:38:43,792 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 17 transitions. Second operand 12 states. [2020-07-29 01:38:43,794 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand 12 states. [2020-07-29 01:38:43,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:43,803 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2020-07-29 01:38:43,804 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2020-07-29 01:38:43,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:43,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:43,805 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states and 17 transitions. [2020-07-29 01:38:43,805 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states and 17 transitions. [2020-07-29 01:38:43,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:43,809 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2020-07-29 01:38:43,809 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2020-07-29 01:38:43,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:43,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:43,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:38:43,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:38:43,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:38:43,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2020-07-29 01:38:43,815 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-07-29 01:38:43,815 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-07-29 01:38:43,815 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:38:43,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2020-07-29 01:38:43,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:43,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:43,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:43,820 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:38:43,821 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:38:43,821 INFO L794 eck$LassoCheckResult]: Stem: 128#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 124#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 125#L367 assume !(main_~length~0 < 1); 130#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 131#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 132#L370-3 assume !(main_~i~0 < main_~length~0); 126#L370-4 main_~j~0 := 0; 127#L378-2 [2020-07-29 01:38:43,821 INFO L796 eck$LassoCheckResult]: Loop: 127#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 129#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 127#L378-2 [2020-07-29 01:38:43,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:43,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2020-07-29 01:38:43,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:43,823 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273778633] [2020-07-29 01:38:43,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:43,956 INFO L280 TraceCheckUtils]: 0: Hoare triple {161#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {161#true} is VALID [2020-07-29 01:38:43,956 INFO L280 TraceCheckUtils]: 1: Hoare triple {161#true} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {161#true} is VALID [2020-07-29 01:38:43,957 INFO L280 TraceCheckUtils]: 2: Hoare triple {161#true} assume !(main_~length~0 < 1); {163#(<= 1 ULTIMATE.start_main_~length~0)} is VALID [2020-07-29 01:38:43,960 INFO L280 TraceCheckUtils]: 3: Hoare triple {163#(<= 1 ULTIMATE.start_main_~length~0)} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {163#(<= 1 ULTIMATE.start_main_~length~0)} is VALID [2020-07-29 01:38:43,961 INFO L280 TraceCheckUtils]: 4: Hoare triple {163#(<= 1 ULTIMATE.start_main_~length~0)} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {164#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~length~0))} is VALID [2020-07-29 01:38:43,962 INFO L280 TraceCheckUtils]: 5: Hoare triple {164#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~length~0))} assume !(main_~i~0 < main_~length~0); {162#false} is VALID [2020-07-29 01:38:43,962 INFO L280 TraceCheckUtils]: 6: Hoare triple {162#false} main_~j~0 := 0; {162#false} is VALID [2020-07-29 01:38:43,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:38:43,963 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273778633] [2020-07-29 01:38:43,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:38:43,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:38:43,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616999406] [2020-07-29 01:38:43,969 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:38:43,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:43,970 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2020-07-29 01:38:43,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:43,970 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291424492] [2020-07-29 01:38:43,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:43,998 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:44,014 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:44,022 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:44,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:38:44,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:38:44,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:38:44,121 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-07-29 01:38:44,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:44,200 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2020-07-29 01:38:44,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:38:44,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:38:44,212 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:38:44,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2020-07-29 01:38:44,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:44,218 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2020-07-29 01:38:44,218 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 01:38:44,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 01:38:44,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2020-07-29 01:38:44,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:38:44,219 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-07-29 01:38:44,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2020-07-29 01:38:44,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2020-07-29 01:38:44,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:38:44,221 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 19 transitions. Second operand 12 states. [2020-07-29 01:38:44,221 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 19 transitions. Second operand 12 states. [2020-07-29 01:38:44,221 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 12 states. [2020-07-29 01:38:44,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:44,224 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2020-07-29 01:38:44,224 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2020-07-29 01:38:44,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:44,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:44,225 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 14 states and 19 transitions. [2020-07-29 01:38:44,225 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 14 states and 19 transitions. [2020-07-29 01:38:44,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:44,227 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2020-07-29 01:38:44,227 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2020-07-29 01:38:44,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:44,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:44,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:38:44,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:38:44,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:38:44,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2020-07-29 01:38:44,229 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 01:38:44,230 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 01:38:44,230 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:38:44,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2020-07-29 01:38:44,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:44,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:44,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:44,232 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:38:44,232 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:38:44,233 INFO L794 eck$LassoCheckResult]: Stem: 187#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 181#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 182#L367 assume !(main_~length~0 < 1); 189#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 190#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 191#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 183#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 184#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 192#L370-3 assume !(main_~i~0 < main_~length~0); 185#L370-4 main_~j~0 := 0; 186#L378-2 [2020-07-29 01:38:44,233 INFO L796 eck$LassoCheckResult]: Loop: 186#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 188#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 186#L378-2 [2020-07-29 01:38:44,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:44,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2020-07-29 01:38:44,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:44,234 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469658117] [2020-07-29 01:38:44,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:44,279 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:44,311 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:44,321 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:44,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:44,322 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2020-07-29 01:38:44,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:44,322 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228476432] [2020-07-29 01:38:44,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:44,334 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:44,345 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:44,349 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:44,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:44,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2020-07-29 01:38:44,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:44,350 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029264648] [2020-07-29 01:38:44,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:44,397 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:44,426 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:44,433 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:44,698 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2020-07-29 01:38:45,405 WARN L193 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2020-07-29 01:38:45,413 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:38:45,413 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:38:45,414 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:38:45,414 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:38:45,414 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:38:45,414 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:45,414 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:38:45,414 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:38:45,414 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration3_Lasso [2020-07-29 01:38:45,414 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:38:45,414 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:38:45,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:45,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:45,518 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2020-07-29 01:38:46,005 WARN L193 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2020-07-29 01:38:46,056 WARN L257 bleTransFormulaUtils]: 4 quantified variables [2020-07-29 01:38:46,057 WARN L257 bleTransFormulaUtils]: 4 quantified variables [2020-07-29 01:38:46,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:46,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:46,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:46,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:46,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:46,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:46,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:46,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:46,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:46,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:46,569 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2020-07-29 01:38:47,040 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2020-07-29 01:38:47,219 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:38:47,219 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:47,225 INFO L120 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-07-29 01:38:47,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:47,227 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:47,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:47,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:47,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:47,228 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:47,228 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:47,230 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:47,252 INFO L120 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-07-29 01:38:47,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:47,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:47,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:47,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:47,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:47,258 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:47,269 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:47,296 INFO L120 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-07-29 01:38:47,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:47,298 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2020-07-29 01:38:47,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:47,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:47,310 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2020-07-29 01:38:47,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:47,322 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:47,364 INFO L120 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-07-29 01:38:47,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:47,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:47,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:47,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:47,368 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:47,368 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:47,372 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:47,398 INFO L120 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-07-29 01:38:47,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:47,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:47,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:47,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:47,414 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:47,414 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:47,432 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:38:47,463 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-07-29 01:38:47,463 INFO L444 ModelExtractionUtils]: 1 out of 22 variables were initially zero. Simplification set additionally 18 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:47,466 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:47,470 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:38:47,470 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:38:47,471 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2020-07-29 01:38:47,507 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 01:38:47,510 INFO L393 LassoCheck]: Loop: "assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);" "assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211;" [2020-07-29 01:38:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:47,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:47,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:38:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:47,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:47,566 INFO L280 TraceCheckUtils]: 0: Hoare triple {230#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {230#unseeded} is VALID [2020-07-29 01:38:47,567 INFO L280 TraceCheckUtils]: 1: Hoare triple {230#unseeded} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {230#unseeded} is VALID [2020-07-29 01:38:47,567 INFO L280 TraceCheckUtils]: 2: Hoare triple {230#unseeded} assume !(main_~length~0 < 1); {230#unseeded} is VALID [2020-07-29 01:38:47,568 INFO L280 TraceCheckUtils]: 3: Hoare triple {230#unseeded} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {230#unseeded} is VALID [2020-07-29 01:38:47,570 INFO L280 TraceCheckUtils]: 4: Hoare triple {230#unseeded} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {230#unseeded} is VALID [2020-07-29 01:38:47,571 INFO L280 TraceCheckUtils]: 5: Hoare triple {230#unseeded} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {230#unseeded} is VALID [2020-07-29 01:38:47,572 INFO L280 TraceCheckUtils]: 6: Hoare triple {230#unseeded} assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; {230#unseeded} is VALID [2020-07-29 01:38:47,573 INFO L280 TraceCheckUtils]: 7: Hoare triple {230#unseeded} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {230#unseeded} is VALID [2020-07-29 01:38:47,573 INFO L280 TraceCheckUtils]: 8: Hoare triple {230#unseeded} assume !(main_~i~0 < main_~length~0); {230#unseeded} is VALID [2020-07-29 01:38:47,574 INFO L280 TraceCheckUtils]: 9: Hoare triple {230#unseeded} main_~j~0 := 0; {230#unseeded} is VALID [2020-07-29 01:38:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:47,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:38:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:47,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:47,603 INFO L280 TraceCheckUtils]: 0: Hoare triple {233#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~length~0))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {290#(and (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~length~0) (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~j~0)))} is VALID [2020-07-29 01:38:47,605 INFO L280 TraceCheckUtils]: 1: Hoare triple {290#(and (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~length~0) (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~j~0)))} assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; {258#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~length~0))) unseeded)} is VALID [2020-07-29 01:38:47,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:38:47,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:38:47,618 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:38:47,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:38:47,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,619 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:38:47,619 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-07-29 01:38:47,667 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 16 states and 22 transitions. Complement of second has 5 states. [2020-07-29 01:38:47,667 INFO L141 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-07-29 01:38:47,667 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:47,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. cyclomatic complexity: 6 [2020-07-29 01:38:47,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:47,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:47,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:38:47,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:47,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:47,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:47,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2020-07-29 01:38:47,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:47,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:47,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:47,671 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 16 transitions. cyclomatic complexity: 6 [2020-07-29 01:38:47,672 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:38:47,672 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:38:47,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:47,673 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:38:47,674 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 22 transitions. cyclomatic complexity: 9 [2020-07-29 01:38:47,674 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:38:47,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:38:47,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:38:47,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:38:47,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:47,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:47,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:47,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:38:47,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:38:47,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:38:47,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:38:47,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:38:47,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:38:47,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:38:47,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:38:47,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:38:47,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:38:47,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:38:47,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:38:47,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:38:47,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:38:47,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:38:47,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:38:47,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:38:47,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:38:47,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:47,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:47,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:47,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:38:47,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:38:47,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:38:47,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:38:47,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:38:47,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:38:47,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,688 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:47,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:38:47,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2020-07-29 01:38:47,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:38:47,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:38:47,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:38:47,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:47,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. cyclomatic complexity: 9 [2020-07-29 01:38:47,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:47,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2020-07-29 01:38:47,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:38:47,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:38:47,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2020-07-29 01:38:47,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:38:47,694 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-07-29 01:38:47,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2020-07-29 01:38:47,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-29 01:38:47,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:38:47,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 22 transitions. Second operand 16 states. [2020-07-29 01:38:47,696 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 22 transitions. Second operand 16 states. [2020-07-29 01:38:47,697 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 16 states. [2020-07-29 01:38:47,697 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:38:47,700 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2020-07-29 01:38:47,701 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2020-07-29 01:38:47,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:47,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:47,702 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states and 22 transitions. [2020-07-29 01:38:47,702 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states and 22 transitions. [2020-07-29 01:38:47,703 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:38:47,705 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2020-07-29 01:38:47,705 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2020-07-29 01:38:47,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:47,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:47,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:38:47,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:38:47,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 01:38:47,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2020-07-29 01:38:47,707 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-07-29 01:38:47,708 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-07-29 01:38:47,708 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:38:47,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2020-07-29 01:38:47,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:47,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:47,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:47,709 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:38:47,710 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:38:47,710 INFO L794 eck$LassoCheckResult]: Stem: 323#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 317#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 318#L367 assume !(main_~length~0 < 1); 329#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 330#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 331#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 319#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 320#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 332#L370-3 assume !(main_~i~0 < main_~length~0); 321#L370-4 main_~j~0 := 0; 322#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 328#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 324#L378-2 [2020-07-29 01:38:47,710 INFO L796 eck$LassoCheckResult]: Loop: 324#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 325#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 324#L378-2 [2020-07-29 01:38:47,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:47,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2020-07-29 01:38:47,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:47,711 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375646088] [2020-07-29 01:38:47,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:47,734 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:47,755 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:47,759 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:47,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:47,760 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2020-07-29 01:38:47,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:47,761 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196269175] [2020-07-29 01:38:47,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:47,766 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:47,771 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:47,773 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:47,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:47,773 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2020-07-29 01:38:47,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:47,774 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878924284] [2020-07-29 01:38:47,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:47,811 INFO L280 TraceCheckUtils]: 0: Hoare triple {428#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {428#true} is VALID [2020-07-29 01:38:47,812 INFO L280 TraceCheckUtils]: 1: Hoare triple {428#true} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {428#true} is VALID [2020-07-29 01:38:47,812 INFO L280 TraceCheckUtils]: 2: Hoare triple {428#true} assume !(main_~length~0 < 1); {428#true} is VALID [2020-07-29 01:38:47,813 INFO L280 TraceCheckUtils]: 3: Hoare triple {428#true} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {428#true} is VALID [2020-07-29 01:38:47,813 INFO L280 TraceCheckUtils]: 4: Hoare triple {428#true} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {428#true} is VALID [2020-07-29 01:38:47,813 INFO L280 TraceCheckUtils]: 5: Hoare triple {428#true} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {428#true} is VALID [2020-07-29 01:38:47,813 INFO L280 TraceCheckUtils]: 6: Hoare triple {428#true} assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; {428#true} is VALID [2020-07-29 01:38:47,813 INFO L280 TraceCheckUtils]: 7: Hoare triple {428#true} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {428#true} is VALID [2020-07-29 01:38:47,814 INFO L280 TraceCheckUtils]: 8: Hoare triple {428#true} assume !(main_~i~0 < main_~length~0); {428#true} is VALID [2020-07-29 01:38:47,816 INFO L280 TraceCheckUtils]: 9: Hoare triple {428#true} main_~j~0 := 0; {430#(= 0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-29 01:38:47,817 INFO L280 TraceCheckUtils]: 10: Hoare triple {430#(= 0 ULTIMATE.start_main_~j~0)} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {430#(= 0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-29 01:38:47,818 INFO L280 TraceCheckUtils]: 11: Hoare triple {430#(= 0 ULTIMATE.start_main_~j~0)} assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; {431#(<= (+ ULTIMATE.start_main_~j~0 1) 0)} is VALID [2020-07-29 01:38:47,819 INFO L280 TraceCheckUtils]: 12: Hoare triple {431#(<= (+ ULTIMATE.start_main_~j~0 1) 0)} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {429#false} is VALID [2020-07-29 01:38:47,819 INFO L280 TraceCheckUtils]: 13: Hoare triple {429#false} assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; {429#false} is VALID [2020-07-29 01:38:47,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 01:38:47,820 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878924284] [2020-07-29 01:38:47,820 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602743578] [2020-07-29 01:38:47,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-07-29 01:38:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:47,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:38:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:47,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:47,938 INFO L280 TraceCheckUtils]: 0: Hoare triple {428#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {428#true} is VALID [2020-07-29 01:38:47,938 INFO L280 TraceCheckUtils]: 1: Hoare triple {428#true} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {428#true} is VALID [2020-07-29 01:38:47,939 INFO L280 TraceCheckUtils]: 2: Hoare triple {428#true} assume !(main_~length~0 < 1); {428#true} is VALID [2020-07-29 01:38:47,939 INFO L280 TraceCheckUtils]: 3: Hoare triple {428#true} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {428#true} is VALID [2020-07-29 01:38:47,939 INFO L280 TraceCheckUtils]: 4: Hoare triple {428#true} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {428#true} is VALID [2020-07-29 01:38:47,940 INFO L280 TraceCheckUtils]: 5: Hoare triple {428#true} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {428#true} is VALID [2020-07-29 01:38:47,940 INFO L280 TraceCheckUtils]: 6: Hoare triple {428#true} assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; {428#true} is VALID [2020-07-29 01:38:47,940 INFO L280 TraceCheckUtils]: 7: Hoare triple {428#true} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {428#true} is VALID [2020-07-29 01:38:47,941 INFO L280 TraceCheckUtils]: 8: Hoare triple {428#true} assume !(main_~i~0 < main_~length~0); {428#true} is VALID [2020-07-29 01:38:47,942 INFO L280 TraceCheckUtils]: 9: Hoare triple {428#true} main_~j~0 := 0; {462#(<= ULTIMATE.start_main_~j~0 0)} is VALID [2020-07-29 01:38:47,942 INFO L280 TraceCheckUtils]: 10: Hoare triple {462#(<= ULTIMATE.start_main_~j~0 0)} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {462#(<= ULTIMATE.start_main_~j~0 0)} is VALID [2020-07-29 01:38:47,946 INFO L280 TraceCheckUtils]: 11: Hoare triple {462#(<= ULTIMATE.start_main_~j~0 0)} assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; {431#(<= (+ ULTIMATE.start_main_~j~0 1) 0)} is VALID [2020-07-29 01:38:47,948 INFO L280 TraceCheckUtils]: 12: Hoare triple {431#(<= (+ ULTIMATE.start_main_~j~0 1) 0)} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {429#false} is VALID [2020-07-29 01:38:47,948 INFO L280 TraceCheckUtils]: 13: Hoare triple {429#false} assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; {429#false} is VALID [2020-07-29 01:38:47,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 01:38:47,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:38:47,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2020-07-29 01:38:47,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821132138] [2020-07-29 01:38:48,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:38:48,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:38:48,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:38:48,048 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-07-29 01:38:48,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:48,096 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-07-29 01:38:48,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:38:48,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:38:48,125 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:38:48,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2020-07-29 01:38:48,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:48,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 22 transitions. [2020-07-29 01:38:48,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:38:48,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:38:48,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2020-07-29 01:38:48,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:38:48,130 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2020-07-29 01:38:48,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2020-07-29 01:38:48,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-07-29 01:38:48,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:38:48,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 22 transitions. Second operand 16 states. [2020-07-29 01:38:48,132 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 22 transitions. Second operand 16 states. [2020-07-29 01:38:48,132 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 16 states. [2020-07-29 01:38:48,133 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:38:48,134 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2020-07-29 01:38:48,134 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2020-07-29 01:38:48,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:48,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:48,135 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 17 states and 22 transitions. [2020-07-29 01:38:48,135 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 17 states and 22 transitions. [2020-07-29 01:38:48,136 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:38:48,137 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2020-07-29 01:38:48,137 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2020-07-29 01:38:48,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:48,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:48,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:38:48,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:38:48,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 01:38:48,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2020-07-29 01:38:48,139 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-07-29 01:38:48,139 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-07-29 01:38:48,139 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:38:48,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2020-07-29 01:38:48,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:48,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:48,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:48,140 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:38:48,140 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:38:48,141 INFO L794 eck$LassoCheckResult]: Stem: 497#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 491#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 492#L367 assume !(main_~length~0 < 1); 501#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 502#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 503#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 493#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 494#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 504#L370-3 assume !(main_~i~0 < main_~length~0); 495#L370-4 main_~j~0 := 0; 496#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 498#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 499#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 500#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 505#L378-2 [2020-07-29 01:38:48,141 INFO L796 eck$LassoCheckResult]: Loop: 505#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 506#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 505#L378-2 [2020-07-29 01:38:48,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:48,141 INFO L82 PathProgramCache]: Analyzing trace with hash -645453020, now seen corresponding path program 2 times [2020-07-29 01:38:48,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:48,142 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548026591] [2020-07-29 01:38:48,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:48,278 INFO L280 TraceCheckUtils]: 0: Hoare triple {606#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {606#true} is VALID [2020-07-29 01:38:48,279 INFO L280 TraceCheckUtils]: 1: Hoare triple {606#true} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {606#true} is VALID [2020-07-29 01:38:48,279 INFO L280 TraceCheckUtils]: 2: Hoare triple {606#true} assume !(main_~length~0 < 1); {606#true} is VALID [2020-07-29 01:38:48,281 INFO L280 TraceCheckUtils]: 3: Hoare triple {606#true} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {608#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:48,283 INFO L280 TraceCheckUtils]: 4: Hoare triple {608#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {609#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:48,284 INFO L280 TraceCheckUtils]: 5: Hoare triple {609#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {609#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:48,289 INFO L280 TraceCheckUtils]: 6: Hoare triple {609#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; {609#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:48,294 INFO L280 TraceCheckUtils]: 7: Hoare triple {609#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {610#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset) (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 01:38:48,296 INFO L280 TraceCheckUtils]: 8: Hoare triple {610#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset) (<= ULTIMATE.start_main_~i~0 1))} assume !(main_~i~0 < main_~length~0); {611#(and (<= (select |#length| ULTIMATE.start_main_~arr~0.base) 4) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:48,298 INFO L280 TraceCheckUtils]: 9: Hoare triple {611#(and (<= (select |#length| ULTIMATE.start_main_~arr~0.base) 4) (= 0 ULTIMATE.start_main_~arr~0.offset))} main_~j~0 := 0; {612#(and (<= (select |#length| ULTIMATE.start_main_~arr~0.base) 4) (= 0 ULTIMATE.start_main_~j~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:48,299 INFO L280 TraceCheckUtils]: 10: Hoare triple {612#(and (<= (select |#length| ULTIMATE.start_main_~arr~0.base) 4) (= 0 ULTIMATE.start_main_~j~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {612#(and (<= (select |#length| ULTIMATE.start_main_~arr~0.base) 4) (= 0 ULTIMATE.start_main_~j~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:48,300 INFO L280 TraceCheckUtils]: 11: Hoare triple {612#(and (<= (select |#length| ULTIMATE.start_main_~arr~0.base) 4) (= 0 ULTIMATE.start_main_~j~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; {613#(and (= 0 ULTIMATE.start_main_~arr~0.offset) (<= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~j~0)))} is VALID [2020-07-29 01:38:48,302 INFO L280 TraceCheckUtils]: 12: Hoare triple {613#(and (= 0 ULTIMATE.start_main_~arr~0.offset) (<= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~j~0)))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {607#false} is VALID [2020-07-29 01:38:48,302 INFO L280 TraceCheckUtils]: 13: Hoare triple {607#false} assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; {607#false} is VALID [2020-07-29 01:38:48,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:38:48,304 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548026591] [2020-07-29 01:38:48,304 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919678680] [2020-07-29 01:38:48,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-07-29 01:38:48,351 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:38:48,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:38:48,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:38:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:48,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:48,536 INFO L280 TraceCheckUtils]: 0: Hoare triple {606#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {606#true} is VALID [2020-07-29 01:38:48,536 INFO L280 TraceCheckUtils]: 1: Hoare triple {606#true} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {606#true} is VALID [2020-07-29 01:38:48,536 INFO L280 TraceCheckUtils]: 2: Hoare triple {606#true} assume !(main_~length~0 < 1); {606#true} is VALID [2020-07-29 01:38:48,537 INFO L280 TraceCheckUtils]: 3: Hoare triple {606#true} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {606#true} is VALID [2020-07-29 01:38:48,538 INFO L280 TraceCheckUtils]: 4: Hoare triple {606#true} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {629#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:38:48,538 INFO L280 TraceCheckUtils]: 5: Hoare triple {629#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {629#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:38:48,539 INFO L280 TraceCheckUtils]: 6: Hoare triple {629#(<= ULTIMATE.start_main_~i~0 0)} assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; {629#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:38:48,540 INFO L280 TraceCheckUtils]: 7: Hoare triple {629#(<= ULTIMATE.start_main_~i~0 0)} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {639#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:38:48,545 INFO L280 TraceCheckUtils]: 8: Hoare triple {639#(<= ULTIMATE.start_main_~i~0 1)} assume !(main_~i~0 < main_~length~0); {643#(<= ULTIMATE.start_main_~length~0 1)} is VALID [2020-07-29 01:38:48,546 INFO L280 TraceCheckUtils]: 9: Hoare triple {643#(<= ULTIMATE.start_main_~length~0 1)} main_~j~0 := 0; {647#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:38:48,546 INFO L280 TraceCheckUtils]: 10: Hoare triple {647#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {647#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:38:48,547 INFO L280 TraceCheckUtils]: 11: Hoare triple {647#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; {654#(and (<= ULTIMATE.start_main_~length~0 1) (<= 1 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:38:48,548 INFO L280 TraceCheckUtils]: 12: Hoare triple {654#(and (<= ULTIMATE.start_main_~length~0 1) (<= 1 ULTIMATE.start_main_~j~0))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {607#false} is VALID [2020-07-29 01:38:48,548 INFO L280 TraceCheckUtils]: 13: Hoare triple {607#false} assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; {607#false} is VALID [2020-07-29 01:38:48,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:38:48,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:38:48,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2020-07-29 01:38:48,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21953997] [2020-07-29 01:38:48,550 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:38:48,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:48,550 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2020-07-29 01:38:48,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:48,551 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076536476] [2020-07-29 01:38:48,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:48,556 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:48,560 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:48,561 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:48,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:38:48,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-29 01:38:48,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2020-07-29 01:38:48,631 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand 13 states. [2020-07-29 01:38:49,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:49,191 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2020-07-29 01:38:49,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-29 01:38:49,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-29 01:38:49,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:38:49,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2020-07-29 01:38:49,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:49,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 27 transitions. [2020-07-29 01:38:49,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:38:49,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:38:49,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2020-07-29 01:38:49,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:38:49,249 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2020-07-29 01:38:49,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2020-07-29 01:38:49,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2020-07-29 01:38:49,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:38:49,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 27 transitions. Second operand 19 states. [2020-07-29 01:38:49,251 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 27 transitions. Second operand 19 states. [2020-07-29 01:38:49,252 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 19 states. [2020-07-29 01:38:49,252 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:38:49,254 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2020-07-29 01:38:49,254 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2020-07-29 01:38:49,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:49,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:49,255 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 21 states and 27 transitions. [2020-07-29 01:38:49,255 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 21 states and 27 transitions. [2020-07-29 01:38:49,256 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:38:49,257 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2020-07-29 01:38:49,258 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2020-07-29 01:38:49,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:49,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:49,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:38:49,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:38:49,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-29 01:38:49,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2020-07-29 01:38:49,259 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-07-29 01:38:49,259 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-07-29 01:38:49,259 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:38:49,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2020-07-29 01:38:49,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:49,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:49,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:49,261 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:38:49,261 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:38:49,261 INFO L794 eck$LassoCheckResult]: Stem: 707#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 703#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 704#L367 assume !(main_~length~0 < 1); 713#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 714#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 715#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 718#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 716#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 717#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 701#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 702#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 719#L370-3 assume !(main_~i~0 < main_~length~0); 705#L370-4 main_~j~0 := 0; 706#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 711#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 710#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 712#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 708#L378-2 [2020-07-29 01:38:49,261 INFO L796 eck$LassoCheckResult]: Loop: 708#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 709#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 708#L378-2 [2020-07-29 01:38:49,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:49,262 INFO L82 PathProgramCache]: Analyzing trace with hash -685994466, now seen corresponding path program 3 times [2020-07-29 01:38:49,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:49,262 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043768967] [2020-07-29 01:38:49,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:49,290 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:49,337 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:49,342 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:49,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:49,343 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2020-07-29 01:38:49,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:49,343 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645090610] [2020-07-29 01:38:49,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:49,352 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:49,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:49,361 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:49,365 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:49,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:49,370 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684191, now seen corresponding path program 4 times [2020-07-29 01:38:49,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:49,370 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288369550] [2020-07-29 01:38:49,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:49,445 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:49,502 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:49,510 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:50,064 WARN L193 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 120 [2020-07-29 01:38:51,405 WARN L193 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 252 DAG size of output: 81 [2020-07-29 01:38:51,413 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:38:51,413 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:38:51,413 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:38:51,414 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:38:51,414 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:38:51,414 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:51,414 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:38:51,414 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:38:51,414 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration6_Lasso [2020-07-29 01:38:51,414 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:38:51,415 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:38:51,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:51,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:51,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:51,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:51,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:51,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:51,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:51,736 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2020-07-29 01:38:51,823 WARN L257 bleTransFormulaUtils]: 4 quantified variables [2020-07-29 01:38:51,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:51,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:51,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:51,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:52,503 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:38:52,503 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:52,512 INFO L120 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-07-29 01:38:52,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:52,514 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:52,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:52,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:52,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:52,514 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:52,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:52,516 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:52,538 INFO L120 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-07-29 01:38:52,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:52,540 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:52,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:52,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:52,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:52,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:52,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:52,542 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:52,576 INFO L120 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-07-29 01:38:52,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:52,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:52,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:52,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:52,580 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:52,581 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:52,584 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:52,609 INFO L120 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-07-29 01:38:52,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:52,611 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:52,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:52,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:52,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:52,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:52,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:52,618 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:52,658 INFO L120 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-07-29 01:38:52,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:52,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:52,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:52,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:52,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:52,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:52,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:52,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:52,688 INFO L120 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-07-29 01:38:52,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:52,689 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:52,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:52,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:52,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:52,690 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:52,690 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:52,692 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:52,713 INFO L120 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-07-29 01:38:52,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:52,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:52,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:52,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:52,719 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:52,719 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:52,729 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:52,752 INFO L120 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-07-29 01:38:52,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:52,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:52,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:52,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:52,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:52,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:52,762 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:52,785 INFO L120 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-07-29 01:38:52,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:52,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:52,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:52,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:52,791 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:52,791 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:52,805 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:38:52,866 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2020-07-29 01:38:52,866 INFO L444 ModelExtractionUtils]: 7 out of 25 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:52,872 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:38:52,874 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:38:52,874 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:38:52,874 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2020-07-29 01:38:52,923 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-07-29 01:38:52,926 INFO L393 LassoCheck]: Loop: "assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);" "assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211;" [2020-07-29 01:38:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:52,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:52,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:38:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:52,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:52,985 INFO L280 TraceCheckUtils]: 0: Hoare triple {853#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {853#unseeded} is VALID [2020-07-29 01:38:52,986 INFO L280 TraceCheckUtils]: 1: Hoare triple {853#unseeded} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {853#unseeded} is VALID [2020-07-29 01:38:52,986 INFO L280 TraceCheckUtils]: 2: Hoare triple {853#unseeded} assume !(main_~length~0 < 1); {853#unseeded} is VALID [2020-07-29 01:38:52,987 INFO L280 TraceCheckUtils]: 3: Hoare triple {853#unseeded} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {853#unseeded} is VALID [2020-07-29 01:38:52,987 INFO L280 TraceCheckUtils]: 4: Hoare triple {853#unseeded} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {853#unseeded} is VALID [2020-07-29 01:38:52,988 INFO L280 TraceCheckUtils]: 5: Hoare triple {853#unseeded} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {853#unseeded} is VALID [2020-07-29 01:38:52,988 INFO L280 TraceCheckUtils]: 6: Hoare triple {853#unseeded} assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; {853#unseeded} is VALID [2020-07-29 01:38:52,989 INFO L280 TraceCheckUtils]: 7: Hoare triple {853#unseeded} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {853#unseeded} is VALID [2020-07-29 01:38:52,989 INFO L280 TraceCheckUtils]: 8: Hoare triple {853#unseeded} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {853#unseeded} is VALID [2020-07-29 01:38:52,990 INFO L280 TraceCheckUtils]: 9: Hoare triple {853#unseeded} assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; {853#unseeded} is VALID [2020-07-29 01:38:52,990 INFO L280 TraceCheckUtils]: 10: Hoare triple {853#unseeded} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {853#unseeded} is VALID [2020-07-29 01:38:52,991 INFO L280 TraceCheckUtils]: 11: Hoare triple {853#unseeded} assume !(main_~i~0 < main_~length~0); {853#unseeded} is VALID [2020-07-29 01:38:52,991 INFO L280 TraceCheckUtils]: 12: Hoare triple {853#unseeded} main_~j~0 := 0; {853#unseeded} is VALID [2020-07-29 01:38:52,992 INFO L280 TraceCheckUtils]: 13: Hoare triple {853#unseeded} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {853#unseeded} is VALID [2020-07-29 01:38:52,993 INFO L280 TraceCheckUtils]: 14: Hoare triple {853#unseeded} assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; {853#unseeded} is VALID [2020-07-29 01:38:52,993 INFO L280 TraceCheckUtils]: 15: Hoare triple {853#unseeded} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {853#unseeded} is VALID [2020-07-29 01:38:52,994 INFO L280 TraceCheckUtils]: 16: Hoare triple {853#unseeded} assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; {853#unseeded} is VALID [2020-07-29 01:38:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:52,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:38:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:53,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:53,020 INFO L280 TraceCheckUtils]: 0: Hoare triple {856#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~length~0))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {949#(and (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~length~0) (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~j~0)))} is VALID [2020-07-29 01:38:53,022 INFO L280 TraceCheckUtils]: 1: Hoare triple {949#(and (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~length~0) (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~j~0)))} assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; {896#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~length~0))) unseeded)} is VALID [2020-07-29 01:38:53,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:38:53,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:38:53,036 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:38:53,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:38:53,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,037 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:38:53,037 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-07-29 01:38:53,087 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 5 states. [2020-07-29 01:38:53,087 INFO L141 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-07-29 01:38:53,087 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:53,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. cyclomatic complexity: 8 [2020-07-29 01:38:53,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:53,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:53,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:38:53,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:53,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:53,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:53,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2020-07-29 01:38:53,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:53,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:53,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:53,090 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 24 transitions. cyclomatic complexity: 8 [2020-07-29 01:38:53,091 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:38:53,091 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:38:53,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:53,093 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:38:53,093 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 23 states and 30 transitions. cyclomatic complexity: 11 [2020-07-29 01:38:53,094 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:38:53,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:38:53,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:38:53,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:38:53,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:53,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:53,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:53,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 2 letters. [2020-07-29 01:38:53,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 2 letters. [2020-07-29 01:38:53,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 11 Stem has 19 letters. Loop has 2 letters. [2020-07-29 01:38:53,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 8 Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:38:53,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:38:53,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 11 Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:38:53,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:38:53,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:38:53,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 11 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:38:53,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:38:53,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:38:53,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:38:53,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:38:53,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:38:53,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:38:53,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 2 letters. [2020-07-29 01:38:53,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 2 letters. [2020-07-29 01:38:53,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 11 Stem has 18 letters. Loop has 2 letters. [2020-07-29 01:38:53,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:53,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:53,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:53,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 2 letters. [2020-07-29 01:38:53,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 2 letters. [2020-07-29 01:38:53,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 11 Stem has 19 letters. Loop has 2 letters. [2020-07-29 01:38:53,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 24 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:38:53,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:38:53,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 11 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:38:53,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,107 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:53,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:38:53,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2020-07-29 01:38:53,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:38:53,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 19 letters. Loop has 2 letters. [2020-07-29 01:38:53,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:38:53,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:53,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. cyclomatic complexity: 11 [2020-07-29 01:38:53,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:53,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 30 transitions. [2020-07-29 01:38:53,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 01:38:53,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 01:38:53,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2020-07-29 01:38:53,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:38:53,113 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-07-29 01:38:53,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2020-07-29 01:38:53,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-29 01:38:53,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:38:53,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states and 30 transitions. Second operand 23 states. [2020-07-29 01:38:53,115 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states and 30 transitions. Second operand 23 states. [2020-07-29 01:38:53,116 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand 23 states. [2020-07-29 01:38:53,116 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:38:53,118 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2020-07-29 01:38:53,118 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2020-07-29 01:38:53,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:53,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:53,119 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states and 30 transitions. [2020-07-29 01:38:53,119 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states and 30 transitions. [2020-07-29 01:38:53,120 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:38:53,122 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2020-07-29 01:38:53,122 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2020-07-29 01:38:53,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:53,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:53,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:38:53,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:38:53,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-29 01:38:53,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2020-07-29 01:38:53,125 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-07-29 01:38:53,125 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-07-29 01:38:53,125 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:38:53,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2020-07-29 01:38:53,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:53,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:53,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:53,127 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:38:53,127 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:38:53,127 INFO L794 eck$LassoCheckResult]: Stem: 989#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 985#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 986#L367 assume !(main_~length~0 < 1); 995#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 996#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 997#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 1001#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 998#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 999#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 983#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 984#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 1002#L370-3 assume !(main_~i~0 < main_~length~0); 987#L370-4 main_~j~0 := 0; 988#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 993#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 992#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 994#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 1000#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 1003#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 990#L378-2 [2020-07-29 01:38:53,127 INFO L796 eck$LassoCheckResult]: Loop: 990#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 991#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 990#L378-2 [2020-07-29 01:38:53,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:53,128 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684189, now seen corresponding path program 5 times [2020-07-29 01:38:53,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:53,128 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363885833] [2020-07-29 01:38:53,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:53,767 INFO L280 TraceCheckUtils]: 0: Hoare triple {1137#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1137#true} is VALID [2020-07-29 01:38:53,767 INFO L280 TraceCheckUtils]: 1: Hoare triple {1137#true} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {1137#true} is VALID [2020-07-29 01:38:53,768 INFO L280 TraceCheckUtils]: 2: Hoare triple {1137#true} assume !(main_~length~0 < 1); {1137#true} is VALID [2020-07-29 01:38:53,768 INFO L280 TraceCheckUtils]: 3: Hoare triple {1137#true} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {1139#(= 0 ULTIMATE.start_main_~arr~0.offset)} is VALID [2020-07-29 01:38:53,769 INFO L280 TraceCheckUtils]: 4: Hoare triple {1139#(= 0 ULTIMATE.start_main_~arr~0.offset)} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {1140#(and (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:53,775 INFO L280 TraceCheckUtils]: 5: Hoare triple {1140#(and (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {1141#(and (= 0 ULTIMATE.start_main_~i~0) (= |ULTIMATE.start_main_#t~mem209| (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~i~0 4)))) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:53,776 INFO L280 TraceCheckUtils]: 6: Hoare triple {1141#(and (= 0 ULTIMATE.start_main_~i~0) (= |ULTIMATE.start_main_#t~mem209| (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~i~0 4)))) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; {1142#(and (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset) (or (<= (* 2 (div (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~i~0 4))) 1) 2)) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~i~0 4)))) (<= (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~i~0 4))) 1) 0)))} is VALID [2020-07-29 01:38:53,777 INFO L280 TraceCheckUtils]: 7: Hoare triple {1142#(and (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset) (or (<= (* 2 (div (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~i~0 4))) 1) 2)) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~i~0 4)))) (<= (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~i~0 4))) 1) 0)))} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {1143#(and (or (<= (* 2 (div (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) 1) 2)) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0)) (<= (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) 1) 0)) (not (= 0 (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~i~0)))) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:53,779 INFO L280 TraceCheckUtils]: 8: Hoare triple {1143#(and (or (<= (* 2 (div (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) 1) 2)) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0)) (<= (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) 1) 0)) (not (= 0 (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~i~0)))) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {1144#(and (or (<= (* 2 (div (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) 1) 2)) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0)) (<= (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) 1) 0)) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:53,780 INFO L280 TraceCheckUtils]: 9: Hoare triple {1144#(and (or (<= (* 2 (div (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) 1) 2)) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0)) (<= (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) 1) 0)) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; {1144#(and (or (<= (* 2 (div (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) 1) 2)) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0)) (<= (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) 1) 0)) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:53,781 INFO L280 TraceCheckUtils]: 10: Hoare triple {1144#(and (or (<= (* 2 (div (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) 1) 2)) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0)) (<= (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) 1) 0)) (= 0 ULTIMATE.start_main_~arr~0.offset))} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {1144#(and (or (<= (* 2 (div (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) 1) 2)) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0)) (<= (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) 1) 0)) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:53,783 INFO L280 TraceCheckUtils]: 11: Hoare triple {1144#(and (or (<= (* 2 (div (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) 1) 2)) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0)) (<= (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) 1) 0)) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !(main_~i~0 < main_~length~0); {1144#(and (or (<= (* 2 (div (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) 1) 2)) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0)) (<= (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) 1) 0)) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:53,791 INFO L280 TraceCheckUtils]: 12: Hoare triple {1144#(and (or (<= (* 2 (div (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) 1) 2)) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0)) (<= (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) 1) 0)) (= 0 ULTIMATE.start_main_~arr~0.offset))} main_~j~0 := 0; {1145#(and (or (<= (* 2 (div (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) 1) 2)) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0)) (<= (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) 1) 0)) (= 0 ULTIMATE.start_main_~j~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:53,793 INFO L280 TraceCheckUtils]: 13: Hoare triple {1145#(and (or (<= (* 2 (div (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) 1) 2)) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0)) (<= (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) 1) 0)) (= 0 ULTIMATE.start_main_~j~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {1146#(or (not (= |ULTIMATE.start_main_#t~mem210| (* 2 (div |ULTIMATE.start_main_#t~mem210| 2)))) (and (= |ULTIMATE.start_main_#t~mem210| (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0)) (= 0 ULTIMATE.start_main_~j~0) (= 0 ULTIMATE.start_main_~arr~0.offset)))} is VALID [2020-07-29 01:38:53,795 INFO L280 TraceCheckUtils]: 14: Hoare triple {1146#(or (not (= |ULTIMATE.start_main_#t~mem210| (* 2 (div |ULTIMATE.start_main_#t~mem210| 2)))) (and (= |ULTIMATE.start_main_#t~mem210| (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0)) (= 0 ULTIMATE.start_main_~j~0) (= 0 ULTIMATE.start_main_~arr~0.offset)))} assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; {1147#(and (<= ULTIMATE.start_main_~j~0 1) (<= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) (* 2 (div (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) 2))) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:53,797 INFO L280 TraceCheckUtils]: 15: Hoare triple {1147#(and (<= ULTIMATE.start_main_~j~0 1) (<= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) (* 2 (div (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) 2))) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {1147#(and (<= ULTIMATE.start_main_~j~0 1) (<= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) (* 2 (div (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) 2))) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:53,800 INFO L280 TraceCheckUtils]: 16: Hoare triple {1147#(and (<= ULTIMATE.start_main_~j~0 1) (<= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) (* 2 (div (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) 0) 2))) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; {1148#(and (= 0 ULTIMATE.start_main_~arr~0.offset) (or (and (not (= 0 (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~j~0)))) (<= ULTIMATE.start_main_~j~0 0)) (<= (* 2 (div (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4))) 1) 2)) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4))))))} is VALID [2020-07-29 01:38:53,801 INFO L280 TraceCheckUtils]: 17: Hoare triple {1148#(and (= 0 ULTIMATE.start_main_~arr~0.offset) (or (and (not (= 0 (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~j~0)))) (<= ULTIMATE.start_main_~j~0 0)) (<= (* 2 (div (+ (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4))) 1) 2)) (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4))))))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {1149#(<= |ULTIMATE.start_main_#t~mem210| (* 2 (div |ULTIMATE.start_main_#t~mem210| 2)))} is VALID [2020-07-29 01:38:53,809 INFO L280 TraceCheckUtils]: 18: Hoare triple {1149#(<= |ULTIMATE.start_main_#t~mem210| (* 2 (div |ULTIMATE.start_main_#t~mem210| 2)))} assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; {1138#false} is VALID [2020-07-29 01:38:53,811 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:38:53,812 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363885833] [2020-07-29 01:38:53,812 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553849171] [2020-07-29 01:38:53,812 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-07-29 01:38:53,854 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2020-07-29 01:38:53,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:38:53,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-29 01:38:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:53,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:54,095 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 9 [2020-07-29 01:38:54,095 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:38:54,103 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:38:54,115 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:38:54,116 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:5 [2020-07-29 01:38:54,119 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:38:54,120 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~j~0]. (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4))))) (and (<= 0 ULTIMATE.start_main_~j~0) (= .cse0 |ULTIMATE.start_main_#t~mem210|) (= 0 (mod .cse0 2)) (<= ULTIMATE.start_main_~j~0 0))) [2020-07-29 01:38:54,120 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 0 (mod |ULTIMATE.start_main_#t~mem210| 2)) [2020-07-29 01:38:54,141 INFO L280 TraceCheckUtils]: 0: Hoare triple {1137#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1137#true} is VALID [2020-07-29 01:38:54,142 INFO L280 TraceCheckUtils]: 1: Hoare triple {1137#true} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {1137#true} is VALID [2020-07-29 01:38:54,142 INFO L280 TraceCheckUtils]: 2: Hoare triple {1137#true} assume !(main_~length~0 < 1); {1137#true} is VALID [2020-07-29 01:38:54,142 INFO L280 TraceCheckUtils]: 3: Hoare triple {1137#true} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {1137#true} is VALID [2020-07-29 01:38:54,143 INFO L280 TraceCheckUtils]: 4: Hoare triple {1137#true} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {1137#true} is VALID [2020-07-29 01:38:54,143 INFO L280 TraceCheckUtils]: 5: Hoare triple {1137#true} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {1137#true} is VALID [2020-07-29 01:38:54,143 INFO L280 TraceCheckUtils]: 6: Hoare triple {1137#true} assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; {1137#true} is VALID [2020-07-29 01:38:54,144 INFO L280 TraceCheckUtils]: 7: Hoare triple {1137#true} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {1137#true} is VALID [2020-07-29 01:38:54,144 INFO L280 TraceCheckUtils]: 8: Hoare triple {1137#true} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {1137#true} is VALID [2020-07-29 01:38:54,145 INFO L280 TraceCheckUtils]: 9: Hoare triple {1137#true} assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; {1137#true} is VALID [2020-07-29 01:38:54,145 INFO L280 TraceCheckUtils]: 10: Hoare triple {1137#true} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {1137#true} is VALID [2020-07-29 01:38:54,145 INFO L280 TraceCheckUtils]: 11: Hoare triple {1137#true} assume !(main_~i~0 < main_~length~0); {1137#true} is VALID [2020-07-29 01:38:54,147 INFO L280 TraceCheckUtils]: 12: Hoare triple {1137#true} main_~j~0 := 0; {1189#(<= ULTIMATE.start_main_~j~0 0)} is VALID [2020-07-29 01:38:54,148 INFO L280 TraceCheckUtils]: 13: Hoare triple {1189#(<= ULTIMATE.start_main_~j~0 0)} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {1193#(and (<= 0 ULTIMATE.start_main_~j~0) (= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4))) |ULTIMATE.start_main_#t~mem210|) (<= ULTIMATE.start_main_~j~0 0))} is VALID [2020-07-29 01:38:54,151 INFO L280 TraceCheckUtils]: 14: Hoare triple {1193#(and (<= 0 ULTIMATE.start_main_~j~0) (= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4))) |ULTIMATE.start_main_#t~mem210|) (<= ULTIMATE.start_main_~j~0 0))} assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; {1197#(and (<= ULTIMATE.start_main_~j~0 1) (= 0 (mod (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4) (- 4))) 2)) (<= 1 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:38:54,152 INFO L280 TraceCheckUtils]: 15: Hoare triple {1197#(and (<= ULTIMATE.start_main_~j~0 1) (= 0 (mod (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4) (- 4))) 2)) (<= 1 ULTIMATE.start_main_~j~0))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {1197#(and (<= ULTIMATE.start_main_~j~0 1) (= 0 (mod (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4) (- 4))) 2)) (<= 1 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:38:54,153 INFO L280 TraceCheckUtils]: 16: Hoare triple {1197#(and (<= ULTIMATE.start_main_~j~0 1) (= 0 (mod (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4) (- 4))) 2)) (<= 1 ULTIMATE.start_main_~j~0))} assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; {1204#(and (<= 0 ULTIMATE.start_main_~j~0) (= 0 (mod (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4))) 2)) (<= ULTIMATE.start_main_~j~0 0))} is VALID [2020-07-29 01:38:54,155 INFO L280 TraceCheckUtils]: 17: Hoare triple {1204#(and (<= 0 ULTIMATE.start_main_~j~0) (= 0 (mod (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4))) 2)) (<= ULTIMATE.start_main_~j~0 0))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {1149#(<= |ULTIMATE.start_main_#t~mem210| (* 2 (div |ULTIMATE.start_main_#t~mem210| 2)))} is VALID [2020-07-29 01:38:54,157 INFO L280 TraceCheckUtils]: 18: Hoare triple {1149#(<= |ULTIMATE.start_main_#t~mem210| (* 2 (div |ULTIMATE.start_main_#t~mem210| 2)))} assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; {1138#false} is VALID [2020-07-29 01:38:54,157 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-29 01:38:54,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:38:54,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 16 [2020-07-29 01:38:54,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920240757] [2020-07-29 01:38:54,158 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:38:54,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:54,159 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2020-07-29 01:38:54,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:54,159 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627412596] [2020-07-29 01:38:54,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:54,163 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:54,166 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:54,167 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:54,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:38:54,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-29 01:38:54,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2020-07-29 01:38:54,256 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 11 Second operand 17 states. [2020-07-29 01:38:55,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:55,218 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2020-07-29 01:38:55,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-29 01:38:55,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-29 01:38:55,290 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:38:55,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 55 transitions. [2020-07-29 01:38:55,292 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:38:55,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 42 states and 54 transitions. [2020-07-29 01:38:55,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-07-29 01:38:55,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-07-29 01:38:55,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 54 transitions. [2020-07-29 01:38:55,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:38:55,295 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 54 transitions. [2020-07-29 01:38:55,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 54 transitions. [2020-07-29 01:38:55,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2020-07-29 01:38:55,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:38:55,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states and 54 transitions. Second operand 34 states. [2020-07-29 01:38:55,299 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states and 54 transitions. Second operand 34 states. [2020-07-29 01:38:55,299 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. Second operand 34 states. [2020-07-29 01:38:55,300 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:38:55,301 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2020-07-29 01:38:55,302 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2020-07-29 01:38:55,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:55,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:55,302 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 42 states and 54 transitions. [2020-07-29 01:38:55,302 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 42 states and 54 transitions. [2020-07-29 01:38:55,303 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:38:55,305 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2020-07-29 01:38:55,305 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2020-07-29 01:38:55,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:55,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:55,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:38:55,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:38:55,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-29 01:38:55,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2020-07-29 01:38:55,307 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2020-07-29 01:38:55,307 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2020-07-29 01:38:55,307 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 01:38:55,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2020-07-29 01:38:55,308 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:38:55,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:55,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:55,309 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:38:55,309 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-07-29 01:38:55,309 INFO L794 eck$LassoCheckResult]: Stem: 1271#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1267#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 1268#L367 assume !(main_~length~0 < 1); 1277#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 1278#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 1279#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 1286#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 1280#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 1281#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 1265#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 1266#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 1287#L370-3 assume !(main_~i~0 < main_~length~0); 1269#L370-4 main_~j~0 := 0; 1270#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 1284#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 1285#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 1288#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 1289#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 1291#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 1274#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 1275#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 1294#L378-2 [2020-07-29 01:38:55,309 INFO L796 eck$LassoCheckResult]: Loop: 1294#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 1292#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 1272#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 1273#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 1294#L378-2 [2020-07-29 01:38:55,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:55,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1142942490, now seen corresponding path program 6 times [2020-07-29 01:38:55,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:55,310 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408004063] [2020-07-29 01:38:55,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:55,338 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:55,370 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:55,374 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:55,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:55,375 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2020-07-29 01:38:55,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:55,375 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775505771] [2020-07-29 01:38:55,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:55,380 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:55,385 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:55,387 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:55,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:55,387 INFO L82 PathProgramCache]: Analyzing trace with hash -227346514, now seen corresponding path program 7 times [2020-07-29 01:38:55,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:55,388 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945809082] [2020-07-29 01:38:55,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:55,453 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:55,528 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:55,537 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:56,332 WARN L193 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 136 [2020-07-29 01:38:56,427 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:38:56,438 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-29 01:38:58,267 WARN L193 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 479 DAG size of output: 86 [2020-07-29 01:38:58,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:38:58 BoogieIcfgContainer [2020-07-29 01:38:58,330 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:38:58,330 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:38:58,330 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:38:58,331 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:38:58,331 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:38:41" (3/4) ... [2020-07-29 01:38:58,336 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-07-29 01:38:58,416 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:38:58,416 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:38:58,419 INFO L168 Benchmark]: Toolchain (without parser) took 18486.28 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 371.7 MB). Free memory was 950.8 MB in the beginning and 869.0 MB in the end (delta: 81.9 MB). Peak memory consumption was 453.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:58,419 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:38:58,420 INFO L168 Benchmark]: CACSL2BoogieTranslator took 629.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -170.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:58,420 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:58,421 INFO L168 Benchmark]: Boogie Preprocessor took 30.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:58,421 INFO L168 Benchmark]: RCFGBuilder took 483.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:58,422 INFO L168 Benchmark]: BuchiAutomizer took 17198.47 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.0 MB). Free memory was 1.1 GB in the beginning and 878.9 MB in the end (delta: 204.5 MB). Peak memory consumption was 431.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:58,425 INFO L168 Benchmark]: Witness Printer took 86.25 ms. Allocated memory is still 1.4 GB. Free memory was 878.9 MB in the beginning and 869.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:58,427 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 629.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -170.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 483.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17198.47 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.0 MB). Free memory was 1.1 GB in the beginning and 878.9 MB in the end (delta: 204.5 MB). Peak memory consumption was 431.5 MB. Max. memory is 11.5 GB. * Witness Printer took 86.25 ms. Allocated memory is still 1.4 GB. Free memory was 878.9 MB in the beginning and 869.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function -1 * j + length and consists of 3 locations. One deterministic module has affine ranking function -1 * j + length and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 17 locations. The remainder module has 34 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.1s and 8 iterations. TraceHistogramMax:4. Analysis of lassos took 14.2s. Construction of modules took 0.6s. Büchi inclusion checks took 2.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 34 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 77 SDtfs, 145 SDslu, 99 SDs, 0 SdLazy, 280 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital274 mio100 ax100 hnf98 lsp94 ukn64 mio100 lsp67 div146 bol100 ite100 ukn100 eq166 hnf74 smp72 dnf152 smp82 tf100 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms VariablesStem: 8 VariablesLoop: 3 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 377]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {NULL=0, \result=0, NULL=1, arr=2, arr=0, i=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2bc639fb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b1a5b61=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5ceed261=0, length=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@6d59f471=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5ceed261=2, j=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@7f774d7f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@5a775bfe=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@4682bec4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@43f2acb6=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 377]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND FALSE !(length < 1) [L368] int *arr = __builtin_alloca(length*sizeof(int)); [L369] COND FALSE !(!arr) [L370] i=0 [L370] COND TRUE i