./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/n.c11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 678e0110 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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/loops/n.c11.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash f82cf7726c8201fc884c9fdb36548fce0440ab7f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-678e011 [2019-11-19 22:25:11,035 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:25:11,038 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:25:11,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:25:11,054 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:25:11,056 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:25:11,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:25:11,067 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:25:11,072 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:25:11,074 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:25:11,075 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:25:11,076 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:25:11,077 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:25:11,080 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:25:11,082 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:25:11,083 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:25:11,085 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:25:11,086 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:25:11,088 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:25:11,092 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:25:11,096 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:25:11,098 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:25:11,101 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:25:11,103 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:25:11,105 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:25:11,105 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:25:11,105 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:25:11,107 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:25:11,108 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:25:11,108 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:25:11,109 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:25:11,109 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:25:11,110 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:25:11,111 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:25:11,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:25:11,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:25:11,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:25:11,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:25:11,115 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:25:11,115 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:25:11,117 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:25:11,118 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-19 22:25:11,157 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:25:11,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:25:11,161 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:25:11,162 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:25:11,162 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:25:11,162 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-19 22:25:11,163 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-19 22:25:11,163 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-19 22:25:11,163 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-19 22:25:11,163 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-19 22:25:11,163 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-19 22:25:11,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:25:11,164 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:25:11,165 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 22:25:11,165 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:25:11,165 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:25:11,165 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:25:11,165 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-19 22:25:11,165 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-19 22:25:11,166 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-19 22:25:11,166 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:25:11,166 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:25:11,166 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-19 22:25:11,166 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:25:11,166 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-19 22:25:11,167 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:25:11,167 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:25:11,167 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-19 22:25:11,167 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:25:11,168 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:25:11,168 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-19 22:25:11,170 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-19 22:25:11,170 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f82cf7726c8201fc884c9fdb36548fce0440ab7f [2019-11-19 22:25:11,469 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:25:11,485 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:25:11,488 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:25:11,489 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:25:11,490 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:25:11,490 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/n.c11.c [2019-11-19 22:25:11,555 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04bec595c/9350f41a4ee44232bb424d424284346e/FLAG833a56a23 [2019-11-19 22:25:11,982 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:25:11,982 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/n.c11.c [2019-11-19 22:25:11,989 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04bec595c/9350f41a4ee44232bb424d424284346e/FLAG833a56a23 [2019-11-19 22:25:12,381 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04bec595c/9350f41a4ee44232bb424d424284346e [2019-11-19 22:25:12,385 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:25:12,387 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:25:12,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:25:12,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:25:12,392 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:25:12,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:25:12" (1/1) ... [2019-11-19 22:25:12,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b0aecdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:25:12, skipping insertion in model container [2019-11-19 22:25:12,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:25:12" (1/1) ... [2019-11-19 22:25:12,403 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:25:12,425 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:25:12,618 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:25:12,622 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:25:12,638 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:25:12,653 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:25:12,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:25:12 WrapperNode [2019-11-19 22:25:12,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:25:12,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:25:12,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:25:12,655 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:25:12,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:25:12" (1/1) ... [2019-11-19 22:25:12,669 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:25:12" (1/1) ... [2019-11-19 22:25:12,742 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:25:12,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:25:12,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:25:12,743 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:25:12,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:25:12" (1/1) ... [2019-11-19 22:25:12,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:25:12" (1/1) ... [2019-11-19 22:25:12,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:25:12" (1/1) ... [2019-11-19 22:25:12,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:25:12" (1/1) ... [2019-11-19 22:25:12,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:25:12" (1/1) ... [2019-11-19 22:25:12,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:25:12" (1/1) ... [2019-11-19 22:25:12,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:25:12" (1/1) ... [2019-11-19 22:25:12,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:25:12,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:25:12,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:25:12,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:25:12,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:25:12" (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 [2019-11-19 22:25:12,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:25:12,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:25:12,984 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:25:12,984 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 22:25:12,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:25:12 BoogieIcfgContainer [2019-11-19 22:25:12,986 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:25:12,986 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-19 22:25:12,986 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-19 22:25:12,989 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-19 22:25:12,990 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:25:12,990 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 10:25:12" (1/3) ... [2019-11-19 22:25:12,991 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44f44655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 10:25:12, skipping insertion in model container [2019-11-19 22:25:12,991 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:25:12,992 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:25:12" (2/3) ... [2019-11-19 22:25:12,992 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44f44655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 10:25:12, skipping insertion in model container [2019-11-19 22:25:12,992 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:25:12,992 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:25:12" (3/3) ... [2019-11-19 22:25:12,994 INFO L371 chiAutomizerObserver]: Analyzing ICFG n.c11.c [2019-11-19 22:25:13,040 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-19 22:25:13,041 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-19 22:25:13,041 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-19 22:25:13,041 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:25:13,041 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:25:13,042 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-19 22:25:13,042 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:25:13,042 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-19 22:25:13,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-19 22:25:13,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-19 22:25:13,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:25:13,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:25:13,079 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-19 22:25:13,079 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 22:25:13,079 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-19 22:25:13,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-19 22:25:13,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-19 22:25:13,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:25:13,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:25:13,081 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-19 22:25:13,081 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 22:25:13,087 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;havoc main_~i~0; 7#L19-2true [2019-11-19 22:25:13,088 INFO L796 eck$LassoCheckResult]: Loop: 7#L19-2true assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 3#L21true assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; 11#L21-2true assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 7#L19-2true [2019-11-19 22:25:13,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:13,093 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-19 22:25:13,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:13,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405748465] [2019-11-19 22:25:13,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:25:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:25:13,191 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:25:13,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:13,192 INFO L82 PathProgramCache]: Analyzing trace with hash 39821, now seen corresponding path program 1 times [2019-11-19 22:25:13,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:13,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986967980] [2019-11-19 22:25:13,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:25:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:25:13,236 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:25:13,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:13,238 INFO L82 PathProgramCache]: Analyzing trace with hash 963342, now seen corresponding path program 1 times [2019-11-19 22:25:13,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:13,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538574740] [2019-11-19 22:25:13,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:13,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:25:13,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538574740] [2019-11-19 22:25:13,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:25:13,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 22:25:13,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192352211] [2019-11-19 22:25:13,462 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-11-19 22:25:13,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:25:13,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:25:13,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:25:13,504 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-11-19 22:25:13,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:25:13,539 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-11-19 22:25:13,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:25:13,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2019-11-19 22:25:13,544 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-19 22:25:13,549 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 7 states and 8 transitions. [2019-11-19 22:25:13,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-19 22:25:13,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-19 22:25:13,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2019-11-19 22:25:13,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:25:13,552 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-19 22:25:13,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2019-11-19 22:25:13,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-11-19 22:25:13,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-19 22:25:13,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-11-19 22:25:13,587 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-11-19 22:25:13,587 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-11-19 22:25:13,587 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-19 22:25:13,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2019-11-19 22:25:13,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-19 22:25:13,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:25:13,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:25:13,589 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-19 22:25:13,590 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 22:25:13,590 INFO L794 eck$LassoCheckResult]: Stem: 45#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;havoc main_~i~0; 46#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 43#L21 assume !(4 == main_~len~0 % 4294967296); 44#L21-2 [2019-11-19 22:25:13,590 INFO L796 eck$LassoCheckResult]: Loop: 44#L21-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 47#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 48#L21 assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; 44#L21-2 [2019-11-19 22:25:13,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:13,591 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-11-19 22:25:13,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:13,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84833139] [2019-11-19 22:25:13,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:25:13,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:25:13,602 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:25:13,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:13,603 INFO L82 PathProgramCache]: Analyzing trace with hash 46451, now seen corresponding path program 2 times [2019-11-19 22:25:13,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:13,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581796276] [2019-11-19 22:25:13,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:25:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:25:13,633 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:25:13,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:13,634 INFO L82 PathProgramCache]: Analyzing trace with hash 925831567, now seen corresponding path program 1 times [2019-11-19 22:25:13,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:13,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710835335] [2019-11-19 22:25:13,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:13,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:25:13,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710835335] [2019-11-19 22:25:13,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119780693] [2019-11-19 22:25:13,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:25:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:13,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:25:13,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:25:13,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:25:13,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:25:13,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2019-11-19 22:25:13,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977276517] [2019-11-19 22:25:13,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:25:13,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:25:13,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:25:13,900 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 5 states. [2019-11-19 22:25:13,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:25:13,925 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-11-19 22:25:13,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:25:13,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2019-11-19 22:25:13,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-19 22:25:13,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2019-11-19 22:25:13,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-19 22:25:13,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-19 22:25:13,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2019-11-19 22:25:13,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:25:13,928 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-19 22:25:13,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2019-11-19 22:25:13,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-11-19 22:25:13,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-19 22:25:13,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-11-19 22:25:13,930 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-19 22:25:13,930 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-19 22:25:13,930 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-19 22:25:13,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2019-11-19 22:25:13,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-19 22:25:13,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:25:13,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:25:13,932 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-19 22:25:13,932 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2019-11-19 22:25:13,932 INFO L794 eck$LassoCheckResult]: Stem: 86#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;havoc main_~i~0; 87#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 92#L21 assume !(4 == main_~len~0 % 4294967296); 89#L21-2 [2019-11-19 22:25:13,932 INFO L796 eck$LassoCheckResult]: Loop: 89#L21-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 88#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 84#L21 assume !(4 == main_~len~0 % 4294967296); 85#L21-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 91#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 90#L21 assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; 89#L21-2 [2019-11-19 22:25:13,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:13,933 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 2 times [2019-11-19 22:25:13,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:13,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477456419] [2019-11-19 22:25:13,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:25:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:25:13,941 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:25:13,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:13,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1383897983, now seen corresponding path program 1 times [2019-11-19 22:25:13,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:13,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039159051] [2019-11-19 22:25:13,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:25:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:25:14,012 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:25:14,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:14,013 INFO L82 PathProgramCache]: Analyzing trace with hash -831686173, now seen corresponding path program 2 times [2019-11-19 22:25:14,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:14,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741846841] [2019-11-19 22:25:14,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:14,130 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:25:14,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741846841] [2019-11-19 22:25:14,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374367513] [2019-11-19 22:25:14,131 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:25:14,166 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:25:14,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:25:14,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:25:14,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:25:14,191 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:25:14,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:25:14,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2019-11-19 22:25:14,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832974309] [2019-11-19 22:25:14,310 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-11-19 22:25:14,455 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 25 [2019-11-19 22:25:14,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:25:14,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:25:14,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:25:14,457 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 6 states. [2019-11-19 22:25:14,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:25:14,502 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-11-19 22:25:14,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:25:14,503 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2019-11-19 22:25:14,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-19 22:25:14,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2019-11-19 22:25:14,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-19 22:25:14,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-19 22:25:14,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2019-11-19 22:25:14,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:25:14,506 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-19 22:25:14,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2019-11-19 22:25:14,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-11-19 22:25:14,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-19 22:25:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-11-19 22:25:14,509 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-11-19 22:25:14,509 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-11-19 22:25:14,509 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-19 22:25:14,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2019-11-19 22:25:14,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-19 22:25:14,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:25:14,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:25:14,514 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-19 22:25:14,514 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2019-11-19 22:25:14,514 INFO L794 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;havoc main_~i~0; 144#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 152#L21 assume !(4 == main_~len~0 % 4294967296); 147#L21-2 [2019-11-19 22:25:14,514 INFO L796 eck$LassoCheckResult]: Loop: 147#L21-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 145#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 146#L21 assume !(4 == main_~len~0 % 4294967296); 150#L21-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 151#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 141#L21 assume !(4 == main_~len~0 % 4294967296); 142#L21-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 149#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 148#L21 assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; 147#L21-2 [2019-11-19 22:25:14,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:14,515 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2019-11-19 22:25:14,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:14,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317791728] [2019-11-19 22:25:14,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:25:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:25:14,531 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:25:14,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:14,532 INFO L82 PathProgramCache]: Analyzing trace with hash 313813491, now seen corresponding path program 2 times [2019-11-19 22:25:14,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:14,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12223197] [2019-11-19 22:25:14,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:25:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:25:14,610 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:25:14,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:14,610 INFO L82 PathProgramCache]: Analyzing trace with hash 903627023, now seen corresponding path program 3 times [2019-11-19 22:25:14,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:14,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026064133] [2019-11-19 22:25:14,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:14,730 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:25:14,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026064133] [2019-11-19 22:25:14,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877990357] [2019-11-19 22:25:14,732 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:25:14,773 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-19 22:25:14,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:25:14,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 22:25:14,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:25:14,801 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:25:14,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:25:14,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-19 22:25:14,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201739642] [2019-11-19 22:25:15,734 WARN L191 SmtUtils]: Spent 925.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-11-19 22:25:16,836 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 66 DAG size of output: 29 [2019-11-19 22:25:16,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:25:16,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:25:16,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:25:16,839 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 7 states. [2019-11-19 22:25:16,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:25:16,915 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-11-19 22:25:16,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:25:16,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2019-11-19 22:25:16,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-19 22:25:16,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 17 transitions. [2019-11-19 22:25:16,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-19 22:25:16,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-19 22:25:16,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2019-11-19 22:25:16,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:25:16,918 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-11-19 22:25:16,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2019-11-19 22:25:16,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-11-19 22:25:16,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-19 22:25:16,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-11-19 22:25:16,921 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-19 22:25:16,921 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-19 22:25:16,922 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-19 22:25:16,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2019-11-19 22:25:16,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-19 22:25:16,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:25:16,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:25:16,924 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-19 22:25:16,924 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2019-11-19 22:25:16,924 INFO L794 eck$LassoCheckResult]: Stem: 216#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;havoc main_~i~0; 217#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 214#L21 assume !(4 == main_~len~0 % 4294967296); 215#L21-2 [2019-11-19 22:25:16,924 INFO L796 eck$LassoCheckResult]: Loop: 215#L21-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 218#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 228#L21 assume !(4 == main_~len~0 % 4294967296); 227#L21-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 226#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 225#L21 assume !(4 == main_~len~0 % 4294967296); 224#L21-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 223#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 222#L21 assume !(4 == main_~len~0 % 4294967296); 220#L21-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 221#L19-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 219#L21 assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; 215#L21-2 [2019-11-19 22:25:16,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:16,925 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 4 times [2019-11-19 22:25:16,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:16,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580777364] [2019-11-19 22:25:16,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:25:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:25:16,932 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:25:16,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:16,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1326016769, now seen corresponding path program 3 times [2019-11-19 22:25:16,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:16,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173089108] [2019-11-19 22:25:16,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:25:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:25:16,968 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:25:16,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:16,969 INFO L82 PathProgramCache]: Analyzing trace with hash -902292893, now seen corresponding path program 4 times [2019-11-19 22:25:16,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:16,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451986106] [2019-11-19 22:25:16,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:25:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:25:17,004 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:25:18,621 WARN L191 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-11-19 22:25:20,141 WARN L191 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 103 DAG size of output: 32 [2019-11-19 22:25:20,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 10:25:20 BoogieIcfgContainer [2019-11-19 22:25:20,184 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-19 22:25:20,185 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:25:20,185 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:25:20,185 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:25:20,186 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:25:12" (3/4) ... [2019-11-19 22:25:20,189 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-19 22:25:20,239 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 22:25:20,240 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:25:20,241 INFO L168 Benchmark]: Toolchain (without parser) took 7854.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 957.7 MB in the beginning and 899.2 MB in the end (delta: 58.5 MB). Peak memory consumption was 193.8 MB. Max. memory is 11.5 GB. [2019-11-19 22:25:20,242 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:25:20,243 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.38 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 947.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:25:20,243 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -184.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:25:20,244 INFO L168 Benchmark]: Boogie Preprocessor took 17.92 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. [2019-11-19 22:25:20,245 INFO L168 Benchmark]: RCFGBuilder took 225.30 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: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. [2019-11-19 22:25:20,245 INFO L168 Benchmark]: BuchiAutomizer took 7198.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 899.2 MB in the end (delta: 214.9 MB). Peak memory consumption was 214.9 MB. Max. memory is 11.5 GB. [2019-11-19 22:25:20,246 INFO L168 Benchmark]: Witness Printer took 55.16 ms. Allocated memory is still 1.2 GB. Free memory is still 899.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:25:20,250 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 266.38 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 947.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 87.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -184.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.92 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 225.30 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: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7198.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 899.2 MB in the end (delta: 214.9 MB). Peak memory consumption was 214.9 MB. Max. memory is 11.5 GB. * Witness Printer took 55.16 ms. Allocated memory is still 1.2 GB. Free memory is still 899.2 MB. There was no memory consumed. 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 4 terminating modules (4 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.4 modules have a trivial ranking function, the largest among these consists of 7 locations. The remainder module has 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.1s and 5 iterations. TraceHistogramMax:4. Analysis of lassos took 6.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 15 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 24 SDtfs, 18 SDslu, 30 SDs, 0 SdLazy, 84 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: 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: 19]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {len=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@52b073e6=1, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@34a7fd0d=0, i=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 21]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L13] int a[5]; [L14] unsigned int len=0; [L16] int i; [L19] COND TRUE __VERIFIER_nondet_bool() [L21] COND FALSE !(len==4) Loop: [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE __VERIFIER_nondet_bool() [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE __VERIFIER_nondet_bool() [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE __VERIFIER_nondet_bool() [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE __VERIFIER_nondet_bool() [L21] COND TRUE len==4 [L22] len =0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...