./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/loops/n.c11_true-unreach-call_false-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: 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 /storage/repos/svcomp/c/loops/n.c11_true-unreach-call_false-termination.i -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 24b22c477e8a47eac290a2fc1c5b1e1aaa3a4fa4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-91b1670 [2018-11-28 23:40:54,273 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:40:54,278 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:40:54,299 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:40:54,300 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:40:54,302 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:40:54,304 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:40:54,315 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:40:54,319 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:40:54,322 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:40:54,325 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:40:54,326 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:40:54,328 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:40:54,329 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:40:54,334 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:40:54,335 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:40:54,336 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:40:54,341 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:40:54,349 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:40:54,352 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:40:54,353 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:40:54,354 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:40:54,357 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:40:54,357 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:40:54,357 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:40:54,358 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:40:54,360 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:40:54,361 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:40:54,361 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:40:54,365 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:40:54,365 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:40:54,366 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:40:54,367 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:40:54,367 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:40:54,368 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:40:54,368 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:40:54,369 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 23:40:54,399 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:40:54,399 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:40:54,402 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:40:54,402 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:40:54,402 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:40:54,402 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:40:54,402 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:40:54,403 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:40:54,404 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:40:54,404 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:40:54,404 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:40:54,404 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:40:54,404 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:40:54,405 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:40:54,405 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:40:54,405 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:40:54,405 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:40:54,405 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:40:54,406 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:40:54,407 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:40:54,407 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:40:54,407 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:40:54,407 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:40:54,408 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:40:54,408 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:40:54,408 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:40:54,408 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:40:54,409 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:40:54,409 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:40:54,409 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:40:54,409 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:40:54,410 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:40:54,410 INFO L133 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 -> 24b22c477e8a47eac290a2fc1c5b1e1aaa3a4fa4 [2018-11-28 23:40:54,473 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:40:54,489 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:40:54,494 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:40:54,495 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:40:54,496 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:40:54,497 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/n.c11_true-unreach-call_false-termination.i [2018-11-28 23:40:54,567 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e456e03f/ad7f49539107425fb80fc8c6ce9bf684/FLAGfe2f3c0ea [2018-11-28 23:40:55,072 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:40:55,072 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/n.c11_true-unreach-call_false-termination.i [2018-11-28 23:40:55,079 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e456e03f/ad7f49539107425fb80fc8c6ce9bf684/FLAGfe2f3c0ea [2018-11-28 23:40:55,420 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e456e03f/ad7f49539107425fb80fc8c6ce9bf684 [2018-11-28 23:40:55,425 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:40:55,427 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:40:55,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:40:55,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:40:55,433 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:40:55,434 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:40:55" (1/1) ... [2018-11-28 23:40:55,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f4b0e24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:55, skipping insertion in model container [2018-11-28 23:40:55,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:40:55" (1/1) ... [2018-11-28 23:40:55,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:40:55,469 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:40:55,723 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:40:55,731 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:40:55,755 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:40:55,775 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:40:55,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:55 WrapperNode [2018-11-28 23:40:55,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:40:55,777 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:40:55,777 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:40:55,777 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:40:55,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:55" (1/1) ... [2018-11-28 23:40:55,794 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:55" (1/1) ... [2018-11-28 23:40:55,816 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:40:55,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:40:55,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:40:55,817 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:40:55,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:55" (1/1) ... [2018-11-28 23:40:55,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:55" (1/1) ... [2018-11-28 23:40:55,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:55" (1/1) ... [2018-11-28 23:40:55,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:55" (1/1) ... [2018-11-28 23:40:55,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:55" (1/1) ... [2018-11-28 23:40:55,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:55" (1/1) ... [2018-11-28 23:40:55,840 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:55" (1/1) ... [2018-11-28 23:40:55,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:40:55,842 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:40:55,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:40:55,843 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:40:55,844 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:55" (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 [2018-11-28 23:40:55,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:40:55,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:40:56,195 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:40:56,195 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-28 23:40:56,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:40:56 BoogieIcfgContainer [2018-11-28 23:40:56,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:40:56,197 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:40:56,197 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:40:56,200 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:40:56,201 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:40:56,201 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:40:55" (1/3) ... [2018-11-28 23:40:56,202 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4bdde016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:40:56, skipping insertion in model container [2018-11-28 23:40:56,202 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:40:56,202 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:55" (2/3) ... [2018-11-28 23:40:56,203 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4bdde016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:40:56, skipping insertion in model container [2018-11-28 23:40:56,203 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:40:56,203 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:40:56" (3/3) ... [2018-11-28 23:40:56,205 INFO L375 chiAutomizerObserver]: Analyzing ICFG n.c11_true-unreach-call_false-termination.i [2018-11-28 23:40:56,298 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:40:56,299 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:40:56,300 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:40:56,300 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:40:56,300 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:40:56,301 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:40:56,301 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:40:56,301 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:40:56,301 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:40:56,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-28 23:40:56,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:40:56,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:40:56,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:40:56,377 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 23:40:56,377 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:40:56,378 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:40:56,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-28 23:40:56,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:40:56,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:40:56,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:40:56,380 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 23:40:56,381 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:40:56,390 INFO L794 eck$LassoCheckResult]: Stem: 4#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; 5#L13-2true [2018-11-28 23:40:56,391 INFO L796 eck$LassoCheckResult]: Loop: 5#L13-2true assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 11#L14true assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; 7#L14-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; 5#L13-2true [2018-11-28 23:40:56,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:40:56,398 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-11-28 23:40:56,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:40:56,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:40:56,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:56,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:40:56,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:40:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:40:56,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:40:56,527 INFO L82 PathProgramCache]: Analyzing trace with hash 39821, now seen corresponding path program 1 times [2018-11-28 23:40:56,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:40:56,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:40:56,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:56,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:40:56,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:40:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:40:56,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:40:56,575 INFO L82 PathProgramCache]: Analyzing trace with hash 963342, now seen corresponding path program 1 times [2018-11-28 23:40:56,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:40:56,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:40:56,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:56,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:40:56,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:40:56,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:40:56,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:40:56,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:40:56,850 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2018-11-28 23:40:56,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:40:56,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:40:56,900 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2018-11-28 23:40:56,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:40:56,964 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-28 23:40:56,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:40:56,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2018-11-28 23:40:56,973 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:40:56,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 7 states and 8 transitions. [2018-11-28 23:40:56,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 23:40:56,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 23:40:56,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2018-11-28 23:40:56,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:40:56,985 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-28 23:40:57,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2018-11-28 23:40:57,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-11-28 23:40:57,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 23:40:57,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-11-28 23:40:57,016 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-11-28 23:40:57,016 INFO L608 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-11-28 23:40:57,016 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:40:57,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2018-11-28 23:40:57,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:40:57,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:40:57,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:40:57,018 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:40:57,018 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:40:57,018 INFO L794 eck$LassoCheckResult]: Stem: 43#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; 44#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 48#L14 assume !(4 == main_~len~0 % 4294967296); 47#L14-2 [2018-11-28 23:40:57,018 INFO L796 eck$LassoCheckResult]: Loop: 47#L14-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; 45#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 46#L14 assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; 47#L14-2 [2018-11-28 23:40:57,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:40:57,019 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2018-11-28 23:40:57,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:40:57,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:40:57,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:57,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:40:57,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:40:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:40:57,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:40:57,029 INFO L82 PathProgramCache]: Analyzing trace with hash 46451, now seen corresponding path program 2 times [2018-11-28 23:40:57,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:40:57,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:40:57,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:57,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:40:57,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:40:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:40:57,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:40:57,060 INFO L82 PathProgramCache]: Analyzing trace with hash 925831567, now seen corresponding path program 1 times [2018-11-28 23:40:57,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:40:57,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:40:57,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:57,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:40:57,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:40:57,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:40:57,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:40:57,177 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:40:57,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:40:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:40:57,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:40:57,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:40:57,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:40:57,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2018-11-28 23:40:57,588 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2018-11-28 23:40:57,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:40:57,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:40:57,658 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 5 states. [2018-11-28 23:40:57,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:40:57,711 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-11-28 23:40:57,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:40:57,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2018-11-28 23:40:57,713 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:40:57,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2018-11-28 23:40:57,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:40:57,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:40:57,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2018-11-28 23:40:57,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:40:57,716 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-11-28 23:40:57,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2018-11-28 23:40:57,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-11-28 23:40:57,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 23:40:57,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-11-28 23:40:57,719 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-28 23:40:57,719 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-28 23:40:57,719 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:40:57,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2018-11-28 23:40:57,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:40:57,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:40:57,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:40:57,721 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:40:57,721 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-28 23:40:57,721 INFO L794 eck$LassoCheckResult]: Stem: 84#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; 85#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 92#L14 assume !(4 == main_~len~0 % 4294967296); 88#L14-2 [2018-11-28 23:40:57,721 INFO L796 eck$LassoCheckResult]: Loop: 88#L14-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; 86#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 87#L14 assume !(4 == main_~len~0 % 4294967296); 89#L14-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#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 90#L14 assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; 88#L14-2 [2018-11-28 23:40:57,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:40:57,722 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 2 times [2018-11-28 23:40:57,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:40:57,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:40:57,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:57,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:40:57,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:40:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:40:57,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:40:57,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1383897983, now seen corresponding path program 1 times [2018-11-28 23:40:57,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:40:57,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:40:57,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:57,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:40:57,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:40:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:40:57,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:40:57,764 INFO L82 PathProgramCache]: Analyzing trace with hash -831686173, now seen corresponding path program 2 times [2018-11-28 23:40:57,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:40:57,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:40:57,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:57,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:40:57,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:40:58,010 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:40:58,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:40:58,011 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:40:58,027 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:40:58,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:40:58,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:40:58,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:40:58,130 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:40:58,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:40:58,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2018-11-28 23:40:58,309 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2018-11-28 23:40:58,479 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 25 [2018-11-28 23:40:58,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:40:58,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:40:58,480 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 6 states. [2018-11-28 23:40:58,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:40:58,539 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-28 23:40:58,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:40:58,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2018-11-28 23:40:58,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-28 23:40:58,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2018-11-28 23:40:58,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 23:40:58,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 23:40:58,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2018-11-28 23:40:58,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:40:58,545 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-28 23:40:58,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2018-11-28 23:40:58,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-11-28 23:40:58,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 23:40:58,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-11-28 23:40:58,547 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-28 23:40:58,547 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-28 23:40:58,547 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:40:58,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2018-11-28 23:40:58,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 23:40:58,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:40:58,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:40:58,549 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:40:58,549 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2018-11-28 23:40:58,549 INFO L794 eck$LassoCheckResult]: Stem: 141#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; 142#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 152#L14 assume !(4 == main_~len~0 % 4294967296); 145#L14-2 [2018-11-28 23:40:58,550 INFO L796 eck$LassoCheckResult]: Loop: 145#L14-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; 143#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 144#L14 assume !(4 == main_~len~0 % 4294967296); 150#L14-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#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 146#L14 assume !(4 == main_~len~0 % 4294967296); 147#L14-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#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 148#L14 assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; 145#L14-2 [2018-11-28 23:40:58,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:40:58,550 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2018-11-28 23:40:58,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:40:58,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:40:58,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:58,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:40:58,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:40:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:40:58,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:40:58,559 INFO L82 PathProgramCache]: Analyzing trace with hash 313813491, now seen corresponding path program 2 times [2018-11-28 23:40:58,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:40:58,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:40:58,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:58,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:40:58,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:40:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:40:58,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:40:58,651 INFO L82 PathProgramCache]: Analyzing trace with hash 903627023, now seen corresponding path program 3 times [2018-11-28 23:40:58,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:40:58,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:40:58,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:58,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:40:58,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:40:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:40:59,011 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:40:59,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:40:59,014 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:40:59,024 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:40:59,048 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 23:40:59,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:40:59,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:40:59,087 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:40:59,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:40:59,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-28 23:40:59,742 WARN L180 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2018-11-28 23:41:00,276 WARN L180 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 29 [2018-11-28 23:41:00,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:41:00,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:41:00,277 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 7 states. [2018-11-28 23:41:00,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:41:00,383 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-28 23:41:00,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:41:00,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2018-11-28 23:41:00,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-28 23:41:00,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 17 transitions. [2018-11-28 23:41:00,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-28 23:41:00,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-28 23:41:00,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2018-11-28 23:41:00,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:41:00,387 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-28 23:41:00,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2018-11-28 23:41:00,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-28 23:41:00,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 23:41:00,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-28 23:41:00,391 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-28 23:41:00,391 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-28 23:41:00,391 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:41:00,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2018-11-28 23:41:00,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-28 23:41:00,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:41:00,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:41:00,393 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:41:00,393 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2018-11-28 23:41:00,394 INFO L794 eck$LassoCheckResult]: Stem: 214#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; 215#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 216#L14 assume !(4 == main_~len~0 % 4294967296); 217#L14-2 [2018-11-28 23:41:00,395 INFO L796 eck$LassoCheckResult]: Loop: 217#L14-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#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 228#L14 assume !(4 == main_~len~0 % 4294967296); 227#L14-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#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 225#L14 assume !(4 == main_~len~0 % 4294967296); 224#L14-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#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 222#L14 assume !(4 == main_~len~0 % 4294967296); 220#L14-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#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 219#L14 assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; 217#L14-2 [2018-11-28 23:41:00,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:00,396 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 4 times [2018-11-28 23:41:00,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:00,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:00,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:00,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:00,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:00,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:00,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1326016769, now seen corresponding path program 3 times [2018-11-28 23:41:00,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:00,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:00,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:00,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:00,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:00,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:41:00,490 INFO L82 PathProgramCache]: Analyzing trace with hash -902292893, now seen corresponding path program 4 times [2018-11-28 23:41:00,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:41:00,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:41:00,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:00,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:41:00,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:41:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:41:02,233 WARN L180 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2018-11-28 23:41:05,083 WARN L180 SmtUtils]: Spent 2.66 s on a formula simplification. DAG size of input: 103 DAG size of output: 32 [2018-11-28 23:41:05,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:41:05 BoogieIcfgContainer [2018-11-28 23:41:05,144 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:41:05,144 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:41:05,144 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:41:05,145 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:41:05,145 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:40:56" (3/4) ... [2018-11-28 23:41:05,151 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-28 23:41:05,202 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 23:41:05,202 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:41:05,203 INFO L168 Benchmark]: Toolchain (without parser) took 9778.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 951.3 MB in the beginning and 904.6 MB in the end (delta: 46.8 MB). Peak memory consumption was 181.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:41:05,205 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:41:05,206 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.53 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:41:05,206 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.59 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:41:05,208 INFO L168 Benchmark]: Boogie Preprocessor took 25.23 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:41:05,208 INFO L168 Benchmark]: RCFGBuilder took 353.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:41:05,209 INFO L168 Benchmark]: BuchiAutomizer took 8947.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 904.6 MB in the end (delta: 204.9 MB). Peak memory consumption was 204.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:41:05,210 INFO L168 Benchmark]: Witness Printer took 58.22 ms. Allocated memory is still 1.2 GB. Free memory is still 904.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:41:05,215 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 348.53 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 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 39.59 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.23 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 353.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8947.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 904.6 MB in the end (delta: 204.9 MB). Peak memory consumption was 204.9 MB. Max. memory is 11.5 GB. * Witness Printer took 58.22 ms. Allocated memory is still 1.2 GB. Free memory is still 904.6 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 8.8s and 5 iterations. TraceHistogramMax:4. Analysis of lassos took 8.3s. Construction of modules took 0.2s. 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.2s 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: 13]: 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@3bf51f2e=1, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@45333571=0, i=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 14]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L10] int a[5]; [L11] unsigned int len=0; [L12] int i; [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND FALSE !(len==4) Loop: [L16] EXPR a[len] [L16] a[len]=0 [L17] len++ [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND FALSE !(len==4) [L16] EXPR a[len] [L16] a[len]=0 [L17] len++ [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND FALSE !(len==4) [L16] EXPR a[len] [L16] a[len]=0 [L17] len++ [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND FALSE !(len==4) [L16] EXPR a[len] [L16] a[len]=0 [L17] len++ [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND TRUE len==4 [L15] len =0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...