./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_643dd833-9011-43c3-a71e-678fdead7ba5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_643dd833-9011-43c3-a71e-678fdead7ba5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_643dd833-9011-43c3-a71e-678fdead7ba5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_643dd833-9011-43c3-a71e-678fdead7ba5/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_643dd833-9011-43c3-a71e-678fdead7ba5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_643dd833-9011-43c3-a71e-678fdead7ba5/bin-2019/uautomizer --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 fc492c809d432e4c3053fa8c39191c1c15ea4eea .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.23-aa41828 [2018-11-22 23:56:55,573 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 23:56:55,574 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 23:56:55,582 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 23:56:55,583 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 23:56:55,583 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 23:56:55,584 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 23:56:55,585 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 23:56:55,586 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 23:56:55,587 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 23:56:55,588 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 23:56:55,588 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 23:56:55,589 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 23:56:55,589 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 23:56:55,590 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 23:56:55,591 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 23:56:55,591 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 23:56:55,592 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 23:56:55,594 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 23:56:55,595 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 23:56:55,596 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 23:56:55,596 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 23:56:55,598 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 23:56:55,598 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 23:56:55,598 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 23:56:55,599 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 23:56:55,600 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 23:56:55,600 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 23:56:55,601 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 23:56:55,601 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 23:56:55,602 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 23:56:55,602 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 23:56:55,602 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 23:56:55,602 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 23:56:55,603 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 23:56:55,603 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 23:56:55,604 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_643dd833-9011-43c3-a71e-678fdead7ba5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-22 23:56:55,614 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 23:56:55,614 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 23:56:55,615 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 23:56:55,615 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 23:56:55,616 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 23:56:55,616 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 23:56:55,616 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 23:56:55,616 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 23:56:55,616 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 23:56:55,616 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 23:56:55,616 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 23:56:55,617 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 23:56:55,617 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 23:56:55,617 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 23:56:55,617 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 23:56:55,617 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 23:56:55,617 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 23:56:55,617 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 23:56:55,618 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 23:56:55,618 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 23:56:55,618 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 23:56:55,618 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 23:56:55,618 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 23:56:55,618 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 23:56:55,618 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 23:56:55,619 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 23:56:55,619 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 23:56:55,619 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 23:56:55,619 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 23:56:55,619 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 23:56:55,619 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 23:56:55,620 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 23:56:55,620 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_643dd833-9011-43c3-a71e-678fdead7ba5/bin-2019/uautomizer 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 -> fc492c809d432e4c3053fa8c39191c1c15ea4eea [2018-11-22 23:56:55,643 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 23:56:55,652 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 23:56:55,655 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 23:56:55,656 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 23:56:55,656 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 23:56:55,657 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_643dd833-9011-43c3-a71e-678fdead7ba5/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-22 23:56:55,694 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_643dd833-9011-43c3-a71e-678fdead7ba5/bin-2019/uautomizer/data/f97b6bc25/99154389b26d4db1b758145b00cb67bb/FLAGdd33789a0 [2018-11-22 23:56:55,999 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 23:56:55,999 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_643dd833-9011-43c3-a71e-678fdead7ba5/sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-22 23:56:56,005 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_643dd833-9011-43c3-a71e-678fdead7ba5/bin-2019/uautomizer/data/f97b6bc25/99154389b26d4db1b758145b00cb67bb/FLAGdd33789a0 [2018-11-22 23:56:56,014 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_643dd833-9011-43c3-a71e-678fdead7ba5/bin-2019/uautomizer/data/f97b6bc25/99154389b26d4db1b758145b00cb67bb [2018-11-22 23:56:56,017 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 23:56:56,018 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 23:56:56,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 23:56:56,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 23:56:56,020 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 23:56:56,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:56:56" (1/1) ... [2018-11-22 23:56:56,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22877cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:56:56, skipping insertion in model container [2018-11-22 23:56:56,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:56:56" (1/1) ... [2018-11-22 23:56:56,028 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 23:56:56,041 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 23:56:56,150 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:56:56,153 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 23:56:56,167 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:56:56,177 INFO L195 MainTranslator]: Completed translation [2018-11-22 23:56:56,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:56:56 WrapperNode [2018-11-22 23:56:56,178 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 23:56:56,178 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 23:56:56,178 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 23:56:56,178 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 23:56:56,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:56:56" (1/1) ... [2018-11-22 23:56:56,187 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:56:56" (1/1) ... [2018-11-22 23:56:56,198 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 23:56:56,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 23:56:56,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 23:56:56,199 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 23:56:56,204 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:56:56" (1/1) ... [2018-11-22 23:56:56,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:56:56" (1/1) ... [2018-11-22 23:56:56,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:56:56" (1/1) ... [2018-11-22 23:56:56,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:56:56" (1/1) ... [2018-11-22 23:56:56,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:56:56" (1/1) ... [2018-11-22 23:56:56,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:56:56" (1/1) ... [2018-11-22 23:56:56,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:56:56" (1/1) ... [2018-11-22 23:56:56,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 23:56:56,250 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 23:56:56,250 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 23:56:56,250 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 23:56:56,251 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:56:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_643dd833-9011-43c3-a71e-678fdead7ba5/bin-2019/uautomizer/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-22 23:56:56,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 23:56:56,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 23:56:56,481 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 23:56:56,482 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-22 23:56:56,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:56:56 BoogieIcfgContainer [2018-11-22 23:56:56,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 23:56:56,482 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 23:56:56,482 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 23:56:56,485 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 23:56:56,485 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 23:56:56,485 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 11:56:56" (1/3) ... [2018-11-22 23:56:56,486 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74d667db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 11:56:56, skipping insertion in model container [2018-11-22 23:56:56,486 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 23:56:56,486 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:56:56" (2/3) ... [2018-11-22 23:56:56,487 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74d667db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 11:56:56, skipping insertion in model container [2018-11-22 23:56:56,487 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 23:56:56,487 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:56:56" (3/3) ... [2018-11-22 23:56:56,488 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-22 23:56:56,529 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 23:56:56,530 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 23:56:56,530 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 23:56:56,530 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 23:56:56,530 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 23:56:56,530 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 23:56:56,530 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 23:56:56,530 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 23:56:56,530 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 23:56:56,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-22 23:56:56,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-22 23:56:56,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:56:56,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:56:56,560 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-22 23:56:56,560 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:56:56,560 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 23:56:56,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-11-22 23:56:56,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-22 23:56:56,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:56:56,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:56:56,562 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-22 23:56:56,562 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:56:56,566 INFO L794 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;havoc main_~cond~0; 23#L97-1true [2018-11-22 23:56:56,567 INFO L796 eck$LassoCheckResult]: Loop: 23#L97-1true assume !false;main_~cond~0 := main_#t~nondet6;havoc main_#t~nondet6; 4#L29true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; 28#L46true assume 0 != main_~p1~0;main_~lk1~0 := 1; 25#L46-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 17#L50-1true assume !(0 != main_~p3~0); 8#L54-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 15#L58-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 5#L62-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 24#L66-1true assume !(0 != main_~p1~0); 19#L72-1true assume !(0 != main_~p2~0); 26#L77-1true assume !(0 != main_~p3~0); 3#L82-1true assume !(0 != main_~p4~0); 9#L87-1true assume !(0 != main_~p5~0); 16#L92-1true assume !(0 != main_~p6~0); 23#L97-1true [2018-11-22 23:56:56,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:56:56,571 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-11-22 23:56:56,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:56:56,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:56:56,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:56:56,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:56:56,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:56:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:56:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:56:56,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:56:56,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1799400087, now seen corresponding path program 1 times [2018-11-22 23:56:56,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:56:56,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:56:56,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:56:56,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:56:56,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:56:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:56:56,669 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-22 23:56:56,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:56:56,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:56:56,674 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 23:56:56,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:56:56,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:56:56,684 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2018-11-22 23:56:56,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:56:56,705 INFO L93 Difference]: Finished difference Result 50 states and 81 transitions. [2018-11-22 23:56:56,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:56:56,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 81 transitions. [2018-11-22 23:56:56,708 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2018-11-22 23:56:56,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 40 states and 62 transitions. [2018-11-22 23:56:56,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-22 23:56:56,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-22 23:56:56,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 62 transitions. [2018-11-22 23:56:56,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:56:56,715 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 62 transitions. [2018-11-22 23:56:56,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 62 transitions. [2018-11-22 23:56:56,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-22 23:56:56,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-22 23:56:56,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 62 transitions. [2018-11-22 23:56:56,738 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 62 transitions. [2018-11-22 23:56:56,738 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 62 transitions. [2018-11-22 23:56:56,738 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 23:56:56,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 62 transitions. [2018-11-22 23:56:56,739 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2018-11-22 23:56:56,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:56:56,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:56:56,740 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-22 23:56:56,740 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:56:56,740 INFO L794 eck$LassoCheckResult]: Stem: 105#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;havoc main_~cond~0; 86#L97-1 [2018-11-22 23:56:56,740 INFO L796 eck$LassoCheckResult]: Loop: 86#L97-1 assume !false;main_~cond~0 := main_#t~nondet6;havoc main_#t~nondet6; 98#L29 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; 99#L46 assume !(0 != main_~p1~0); 108#L46-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 124#L50-1 assume !(0 != main_~p3~0); 123#L54-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 122#L58-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 121#L62-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 120#L66-1 assume !(0 != main_~p1~0); 119#L72-1 assume !(0 != main_~p2~0); 117#L77-1 assume !(0 != main_~p3~0); 115#L82-1 assume !(0 != main_~p4~0); 113#L87-1 assume !(0 != main_~p5~0); 85#L92-1 assume !(0 != main_~p6~0); 86#L97-1 [2018-11-22 23:56:56,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:56:56,741 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2018-11-22 23:56:56,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:56:56,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:56:56,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:56:56,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:56:56,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:56:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:56:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:56:56,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:56:56,744 INFO L82 PathProgramCache]: Analyzing trace with hash 2057565525, now seen corresponding path program 1 times [2018-11-22 23:56:56,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:56:56,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:56:56,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:56:56,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:56:56,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:56:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:56:56,768 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-22 23:56:56,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:56:56,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:56:56,768 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 23:56:56,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:56:56,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:56:56,769 INFO L87 Difference]: Start difference. First operand 40 states and 62 transitions. cyclomatic complexity: 24 Second operand 3 states. [2018-11-22 23:56:56,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:56:56,783 INFO L93 Difference]: Finished difference Result 77 states and 117 transitions. [2018-11-22 23:56:56,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:56:56,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 117 transitions. [2018-11-22 23:56:56,785 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 [2018-11-22 23:56:56,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 77 states and 117 transitions. [2018-11-22 23:56:56,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2018-11-22 23:56:56,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2018-11-22 23:56:56,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 117 transitions. [2018-11-22 23:56:56,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:56:56,787 INFO L705 BuchiCegarLoop]: Abstraction has 77 states and 117 transitions. [2018-11-22 23:56:56,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 117 transitions. [2018-11-22 23:56:56,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-22 23:56:56,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-22 23:56:56,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2018-11-22 23:56:56,791 INFO L728 BuchiCegarLoop]: Abstraction has 77 states and 117 transitions. [2018-11-22 23:56:56,791 INFO L608 BuchiCegarLoop]: Abstraction has 77 states and 117 transitions. [2018-11-22 23:56:56,791 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 23:56:56,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 117 transitions. [2018-11-22 23:56:56,792 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 [2018-11-22 23:56:56,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:56:56,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:56:56,792 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-22 23:56:56,792 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:56:56,793 INFO L794 eck$LassoCheckResult]: Stem: 227#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;havoc main_~cond~0; 228#L97-1 [2018-11-22 23:56:56,793 INFO L796 eck$LassoCheckResult]: Loop: 228#L97-1 assume !false;main_~cond~0 := main_#t~nondet6;havoc main_#t~nondet6; 248#L29 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; 246#L46 assume !(0 != main_~p1~0); 245#L46-2 assume !(0 != main_~p2~0); 244#L50-1 assume !(0 != main_~p3~0); 243#L54-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 242#L58-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 241#L62-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 238#L66-1 assume !(0 != main_~p1~0); 239#L72-1 assume !(0 != main_~p2~0); 256#L77-1 assume !(0 != main_~p3~0); 254#L82-1 assume !(0 != main_~p4~0); 252#L87-1 assume !(0 != main_~p5~0); 250#L92-1 assume !(0 != main_~p6~0); 228#L97-1 [2018-11-22 23:56:56,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:56:56,793 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2018-11-22 23:56:56,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:56:56,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:56:56,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:56:56,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:56:56,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:56:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:56:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:56:56,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:56:56,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1536337193, now seen corresponding path program 1 times [2018-11-22 23:56:56,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:56:56,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:56:56,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:56:56,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:56:56,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:56:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:56:56,820 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-22 23:56:56,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:56:56,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:56:56,820 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 23:56:56,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:56:56,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:56:56,821 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. cyclomatic complexity: 44 Second operand 3 states. [2018-11-22 23:56:56,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:56:56,831 INFO L93 Difference]: Finished difference Result 149 states and 221 transitions. [2018-11-22 23:56:56,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:56:56,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 221 transitions. [2018-11-22 23:56:56,832 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 148 [2018-11-22 23:56:56,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 149 states and 221 transitions. [2018-11-22 23:56:56,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 149 [2018-11-22 23:56:56,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 149 [2018-11-22 23:56:56,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 221 transitions. [2018-11-22 23:56:56,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:56:56,835 INFO L705 BuchiCegarLoop]: Abstraction has 149 states and 221 transitions. [2018-11-22 23:56:56,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 221 transitions. [2018-11-22 23:56:56,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-11-22 23:56:56,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-22 23:56:56,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 221 transitions. [2018-11-22 23:56:56,841 INFO L728 BuchiCegarLoop]: Abstraction has 149 states and 221 transitions. [2018-11-22 23:56:56,841 INFO L608 BuchiCegarLoop]: Abstraction has 149 states and 221 transitions. [2018-11-22 23:56:56,841 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-22 23:56:56,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 149 states and 221 transitions. [2018-11-22 23:56:56,842 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 148 [2018-11-22 23:56:56,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:56:56,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:56:56,842 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-22 23:56:56,842 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:56:56,842 INFO L794 eck$LassoCheckResult]: Stem: 459#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;havoc main_~cond~0; 460#L97-1 [2018-11-22 23:56:56,842 INFO L796 eck$LassoCheckResult]: Loop: 460#L97-1 assume !false;main_~cond~0 := main_#t~nondet6;havoc main_#t~nondet6; 493#L29 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; 494#L46 assume !(0 != main_~p1~0); 506#L46-2 assume !(0 != main_~p2~0); 507#L50-1 assume !(0 != main_~p3~0); 476#L54-1 assume !(0 != main_~p4~0); 478#L58-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 544#L62-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 541#L66-1 assume !(0 != main_~p1~0); 537#L72-1 assume !(0 != main_~p2~0); 533#L77-1 assume !(0 != main_~p3~0); 531#L82-1 assume !(0 != main_~p4~0); 525#L87-1 assume !(0 != main_~p5~0); 503#L92-1 assume !(0 != main_~p6~0); 460#L97-1 [2018-11-22 23:56:56,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:56:56,843 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2018-11-22 23:56:56,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:56:56,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:56:56,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:56:56,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:56:56,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:56:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:56:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:56:56,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:56:56,845 INFO L82 PathProgramCache]: Analyzing trace with hash -856278823, now seen corresponding path program 1 times [2018-11-22 23:56:56,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:56:56,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:56:56,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:56:56,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:56:56,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:56:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:56:56,860 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-22 23:56:56,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:56:56,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:56:56,860 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 23:56:56,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:56:56,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:56:56,861 INFO L87 Difference]: Start difference. First operand 149 states and 221 transitions. cyclomatic complexity: 80 Second operand 3 states. [2018-11-22 23:56:56,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:56:56,877 INFO L93 Difference]: Finished difference Result 289 states and 417 transitions. [2018-11-22 23:56:56,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:56:56,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 289 states and 417 transitions. [2018-11-22 23:56:56,879 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 288 [2018-11-22 23:56:56,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 289 states to 289 states and 417 transitions. [2018-11-22 23:56:56,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 289 [2018-11-22 23:56:56,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 289 [2018-11-22 23:56:56,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 289 states and 417 transitions. [2018-11-22 23:56:56,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:56:56,883 INFO L705 BuchiCegarLoop]: Abstraction has 289 states and 417 transitions. [2018-11-22 23:56:56,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states and 417 transitions. [2018-11-22 23:56:56,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2018-11-22 23:56:56,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-11-22 23:56:56,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 417 transitions. [2018-11-22 23:56:56,894 INFO L728 BuchiCegarLoop]: Abstraction has 289 states and 417 transitions. [2018-11-22 23:56:56,894 INFO L608 BuchiCegarLoop]: Abstraction has 289 states and 417 transitions. [2018-11-22 23:56:56,894 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-22 23:56:56,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 289 states and 417 transitions. [2018-11-22 23:56:56,895 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 288 [2018-11-22 23:56:56,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:56:56,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:56:56,896 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-22 23:56:56,896 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:56:56,896 INFO L794 eck$LassoCheckResult]: Stem: 902#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;havoc main_~cond~0; 903#L97-1 [2018-11-22 23:56:56,896 INFO L796 eck$LassoCheckResult]: Loop: 903#L97-1 assume !false;main_~cond~0 := main_#t~nondet6;havoc main_#t~nondet6; 952#L29 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; 947#L46 assume !(0 != main_~p1~0); 939#L46-2 assume !(0 != main_~p2~0); 934#L50-1 assume !(0 != main_~p3~0); 929#L54-1 assume !(0 != main_~p4~0); 930#L58-1 assume !(0 != main_~p5~0); 985#L62-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 982#L66-1 assume !(0 != main_~p1~0); 980#L72-1 assume !(0 != main_~p2~0); 977#L77-1 assume !(0 != main_~p3~0); 972#L82-1 assume !(0 != main_~p4~0); 968#L87-1 assume !(0 != main_~p5~0); 963#L92-1 assume !(0 != main_~p6~0); 903#L97-1 [2018-11-22 23:56:56,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:56:56,897 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2018-11-22 23:56:56,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:56:56,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:56:56,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:56:56,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:56:56,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:56:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:56:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:56:56,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:56:56,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1665625449, now seen corresponding path program 1 times [2018-11-22 23:56:56,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:56:56,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:56:56,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:56:56,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:56:56,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:56:56,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:56:56,919 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-22 23:56:56,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:56:56,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 23:56:56,919 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 23:56:56,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:56:56,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:56:56,919 INFO L87 Difference]: Start difference. First operand 289 states and 417 transitions. cyclomatic complexity: 144 Second operand 3 states. [2018-11-22 23:56:56,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:56:56,939 INFO L93 Difference]: Finished difference Result 561 states and 785 transitions. [2018-11-22 23:56:56,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:56:56,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 561 states and 785 transitions. [2018-11-22 23:56:56,943 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 560 [2018-11-22 23:56:56,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 561 states to 561 states and 785 transitions. [2018-11-22 23:56:56,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 561 [2018-11-22 23:56:56,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 561 [2018-11-22 23:56:56,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 561 states and 785 transitions. [2018-11-22 23:56:56,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:56:56,948 INFO L705 BuchiCegarLoop]: Abstraction has 561 states and 785 transitions. [2018-11-22 23:56:56,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states and 785 transitions. [2018-11-22 23:56:56,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2018-11-22 23:56:56,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-11-22 23:56:56,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 785 transitions. [2018-11-22 23:56:56,965 INFO L728 BuchiCegarLoop]: Abstraction has 561 states and 785 transitions. [2018-11-22 23:56:56,966 INFO L608 BuchiCegarLoop]: Abstraction has 561 states and 785 transitions. [2018-11-22 23:56:56,966 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-22 23:56:56,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 561 states and 785 transitions. [2018-11-22 23:56:56,968 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 560 [2018-11-22 23:56:56,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:56:56,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:56:56,969 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-22 23:56:56,969 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:56:56,969 INFO L794 eck$LassoCheckResult]: Stem: 1759#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;havoc main_~cond~0; 1760#L97-1 [2018-11-22 23:56:56,969 INFO L796 eck$LassoCheckResult]: Loop: 1760#L97-1 assume !false;main_~cond~0 := main_#t~nondet6;havoc main_#t~nondet6; 1896#L29 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; 1891#L46 assume !(0 != main_~p1~0); 1883#L46-2 assume !(0 != main_~p2~0); 1882#L50-1 assume !(0 != main_~p3~0); 1880#L54-1 assume !(0 != main_~p4~0); 1877#L58-1 assume !(0 != main_~p5~0); 1874#L62-1 assume !(0 != main_~p6~0); 1870#L66-1 assume !(0 != main_~p1~0); 1868#L72-1 assume !(0 != main_~p2~0); 1867#L77-1 assume !(0 != main_~p3~0); 1835#L82-1 assume !(0 != main_~p4~0); 1837#L87-1 assume !(0 != main_~p5~0); 1858#L92-1 assume !(0 != main_~p6~0); 1760#L97-1 [2018-11-22 23:56:56,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:56:56,969 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2018-11-22 23:56:56,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:56:56,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:56:56,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:56:56,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:56:56,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:56:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:56:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:56:56,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:56:56,973 INFO L82 PathProgramCache]: Analyzing trace with hash 109381913, now seen corresponding path program 1 times [2018-11-22 23:56:56,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:56:56,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:56:56,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:56:56,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:56:56,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:56:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:56:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:56:56,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:56:56,982 INFO L82 PathProgramCache]: Analyzing trace with hash -401152264, now seen corresponding path program 1 times [2018-11-22 23:56:56,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:56:56,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:56:56,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:56:56,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:56:56,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:56:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:56:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;havoc main_~cond~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L25] havoc main_~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L25] havoc main_~cond~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L25] havoc main_~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L25] havoc main_~cond~0; [L6] ~p1~0 := #t~nondet0; [L6] havoc #t~nondet0; [L7] havoc ~lk1~0; [L9] ~p2~0 := #t~nondet1; [L9] havoc #t~nondet1; [L10] havoc ~lk2~0; [L12] ~p3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] havoc ~lk3~0; [L15] ~p4~0 := #t~nondet3; [L15] havoc #t~nondet3; [L16] havoc ~lk4~0; [L18] ~p5~0 := #t~nondet4; [L18] havoc #t~nondet4; [L19] havoc ~lk5~0; [L21] ~p6~0 := #t~nondet5; [L21] havoc #t~nondet5; [L22] havoc ~lk6~0; [L25] havoc ~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] ~p1~0 := #t~nondet0; [L6] havoc #t~nondet0; [L7] havoc ~lk1~0; [L9] ~p2~0 := #t~nondet1; [L9] havoc #t~nondet1; [L10] havoc ~lk2~0; [L12] ~p3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] havoc ~lk3~0; [L15] ~p4~0 := #t~nondet3; [L15] havoc #t~nondet3; [L16] havoc ~lk4~0; [L18] ~p5~0 := #t~nondet4; [L18] havoc #t~nondet4; [L19] havoc ~lk5~0; [L21] ~p6~0 := #t~nondet5; [L21] havoc #t~nondet5; [L22] havoc ~lk6~0; [L25] havoc ~cond~0; [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L25] int cond; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false;main_~cond~0 := main_#t~nondet6;havoc main_#t~nondet6; [?] assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; [?] assume !(0 != main_~p1~0); [?] assume !(0 != main_~p2~0); [?] assume !(0 != main_~p3~0); [?] assume !(0 != main_~p4~0); [?] assume !(0 != main_~p5~0); [?] assume !(0 != main_~p6~0); [?] assume !(0 != main_~p1~0); [?] assume !(0 != main_~p2~0); [?] assume !(0 != main_~p3~0); [?] assume !(0 != main_~p4~0); [?] assume !(0 != main_~p5~0); [?] assume !(0 != main_~p6~0); [L27-L102] assume !false; [L28] main_~cond~0 := main_#t~nondet6; [L28] havoc main_#t~nondet6; [L29-L31] assume !(0 == main_~cond~0); [L32] main_~lk1~0 := 0; [L34] main_~lk2~0 := 0; [L36] main_~lk3~0 := 0; [L38] main_~lk4~0 := 0; [L40] main_~lk5~0 := 0; [L42] main_~lk6~0 := 0; [L46-L48] assume !(0 != main_~p1~0); [L50-L52] assume !(0 != main_~p2~0); [L54-L56] assume !(0 != main_~p3~0); [L58-L60] assume !(0 != main_~p4~0); [L62-L64] assume !(0 != main_~p5~0); [L66-L68] assume !(0 != main_~p6~0); [L72-L75] assume !(0 != main_~p1~0); [L77-L80] assume !(0 != main_~p2~0); [L82-L85] assume !(0 != main_~p3~0); [L87-L90] assume !(0 != main_~p4~0); [L92-L95] assume !(0 != main_~p5~0); [L97-L100] assume !(0 != main_~p6~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L27-L102] assume !false; [L28] main_~cond~0 := main_#t~nondet6; [L28] havoc main_#t~nondet6; [L29-L31] assume !(0 == main_~cond~0); [L32] main_~lk1~0 := 0; [L34] main_~lk2~0 := 0; [L36] main_~lk3~0 := 0; [L38] main_~lk4~0 := 0; [L40] main_~lk5~0 := 0; [L42] main_~lk6~0 := 0; [L46-L48] assume !(0 != main_~p1~0); [L50-L52] assume !(0 != main_~p2~0); [L54-L56] assume !(0 != main_~p3~0); [L58-L60] assume !(0 != main_~p4~0); [L62-L64] assume !(0 != main_~p5~0); [L66-L68] assume !(0 != main_~p6~0); [L72-L75] assume !(0 != main_~p1~0); [L77-L80] assume !(0 != main_~p2~0); [L82-L85] assume !(0 != main_~p3~0); [L87-L90] assume !(0 != main_~p4~0); [L92-L95] assume !(0 != main_~p5~0); [L97-L100] assume !(0 != main_~p6~0); [L27-L102] COND FALSE !(false) [L28] main_~cond~0 := main_#t~nondet6; [L28] havoc main_#t~nondet6; [L29] COND FALSE !(0 == main_~cond~0) [L32] main_~lk1~0 := 0; [L34] main_~lk2~0 := 0; [L36] main_~lk3~0 := 0; [L38] main_~lk4~0 := 0; [L40] main_~lk5~0 := 0; [L42] main_~lk6~0 := 0; [L46] COND FALSE !(0 != main_~p1~0) [L50] COND FALSE !(0 != main_~p2~0) [L54] COND FALSE !(0 != main_~p3~0) [L58] COND FALSE !(0 != main_~p4~0) [L62] COND FALSE !(0 != main_~p5~0) [L66] COND FALSE !(0 != main_~p6~0) [L72] COND FALSE !(0 != main_~p1~0) [L77] COND FALSE !(0 != main_~p2~0) [L82] COND FALSE !(0 != main_~p3~0) [L87] COND FALSE !(0 != main_~p4~0) [L92] COND FALSE !(0 != main_~p5~0) [L97] COND FALSE !(0 != main_~p6~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L27-L102] COND FALSE !(false) [L28] main_~cond~0 := main_#t~nondet6; [L28] havoc main_#t~nondet6; [L29] COND FALSE !(0 == main_~cond~0) [L32] main_~lk1~0 := 0; [L34] main_~lk2~0 := 0; [L36] main_~lk3~0 := 0; [L38] main_~lk4~0 := 0; [L40] main_~lk5~0 := 0; [L42] main_~lk6~0 := 0; [L46] COND FALSE !(0 != main_~p1~0) [L50] COND FALSE !(0 != main_~p2~0) [L54] COND FALSE !(0 != main_~p3~0) [L58] COND FALSE !(0 != main_~p4~0) [L62] COND FALSE !(0 != main_~p5~0) [L66] COND FALSE !(0 != main_~p6~0) [L72] COND FALSE !(0 != main_~p1~0) [L77] COND FALSE !(0 != main_~p2~0) [L82] COND FALSE !(0 != main_~p3~0) [L87] COND FALSE !(0 != main_~p4~0) [L92] COND FALSE !(0 != main_~p5~0) [L97] COND FALSE !(0 != main_~p6~0) [L27-L102] COND FALSE !(false) [L28] ~cond~0 := #t~nondet6; [L28] havoc #t~nondet6; [L29] COND FALSE !(0 == ~cond~0) [L32] ~lk1~0 := 0; [L34] ~lk2~0 := 0; [L36] ~lk3~0 := 0; [L38] ~lk4~0 := 0; [L40] ~lk5~0 := 0; [L42] ~lk6~0 := 0; [L46] COND FALSE !(0 != ~p1~0) [L50] COND FALSE !(0 != ~p2~0) [L54] COND FALSE !(0 != ~p3~0) [L58] COND FALSE !(0 != ~p4~0) [L62] COND FALSE !(0 != ~p5~0) [L66] COND FALSE !(0 != ~p6~0) [L72] COND FALSE !(0 != ~p1~0) [L77] COND FALSE !(0 != ~p2~0) [L82] COND FALSE !(0 != ~p3~0) [L87] COND FALSE !(0 != ~p4~0) [L92] COND FALSE !(0 != ~p5~0) [L97] COND FALSE !(0 != ~p6~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L27-L102] COND FALSE !(false) [L28] ~cond~0 := #t~nondet6; [L28] havoc #t~nondet6; [L29] COND FALSE !(0 == ~cond~0) [L32] ~lk1~0 := 0; [L34] ~lk2~0 := 0; [L36] ~lk3~0 := 0; [L38] ~lk4~0 := 0; [L40] ~lk5~0 := 0; [L42] ~lk6~0 := 0; [L46] COND FALSE !(0 != ~p1~0) [L50] COND FALSE !(0 != ~p2~0) [L54] COND FALSE !(0 != ~p3~0) [L58] COND FALSE !(0 != ~p4~0) [L62] COND FALSE !(0 != ~p5~0) [L66] COND FALSE !(0 != ~p6~0) [L72] COND FALSE !(0 != ~p1~0) [L77] COND FALSE !(0 != ~p2~0) [L82] COND FALSE !(0 != ~p3~0) [L87] COND FALSE !(0 != ~p4~0) [L92] COND FALSE !(0 != ~p5~0) [L97] COND FALSE !(0 != ~p6~0) [L27] COND TRUE 1 [L28] cond = __VERIFIER_nondet_int() [L29] COND FALSE !(cond == 0) [L32] lk1 = 0 [L34] lk2 = 0 [L36] lk3 = 0 [L38] lk4 = 0 [L40] lk5 = 0 [L42] lk6 = 0 [L46] COND FALSE !(p1 != 0) [L50] COND FALSE !(p2 != 0) [L54] COND FALSE !(p3 != 0) [L58] COND FALSE !(p4 != 0) [L62] COND FALSE !(p5 != 0) [L66] COND FALSE !(p6 != 0) [L72] COND FALSE !(p1 != 0) [L77] COND FALSE !(p2 != 0) [L82] COND FALSE !(p3 != 0) [L87] COND FALSE !(p4 != 0) [L92] COND FALSE !(p5 != 0) [L97] COND FALSE !(p6 != 0) ----- [2018-11-22 23:56:57,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 11:56:57 BoogieIcfgContainer [2018-11-22 23:56:57,091 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 23:56:57,091 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 23:56:57,091 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 23:56:57,091 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 23:56:57,092 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:56:56" (3/4) ... [2018-11-22 23:56:57,095 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;havoc main_~cond~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L25] havoc main_~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L25] havoc main_~cond~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L25] havoc main_~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L25] havoc main_~cond~0; [L6] ~p1~0 := #t~nondet0; [L6] havoc #t~nondet0; [L7] havoc ~lk1~0; [L9] ~p2~0 := #t~nondet1; [L9] havoc #t~nondet1; [L10] havoc ~lk2~0; [L12] ~p3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] havoc ~lk3~0; [L15] ~p4~0 := #t~nondet3; [L15] havoc #t~nondet3; [L16] havoc ~lk4~0; [L18] ~p5~0 := #t~nondet4; [L18] havoc #t~nondet4; [L19] havoc ~lk5~0; [L21] ~p6~0 := #t~nondet5; [L21] havoc #t~nondet5; [L22] havoc ~lk6~0; [L25] havoc ~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] ~p1~0 := #t~nondet0; [L6] havoc #t~nondet0; [L7] havoc ~lk1~0; [L9] ~p2~0 := #t~nondet1; [L9] havoc #t~nondet1; [L10] havoc ~lk2~0; [L12] ~p3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] havoc ~lk3~0; [L15] ~p4~0 := #t~nondet3; [L15] havoc #t~nondet3; [L16] havoc ~lk4~0; [L18] ~p5~0 := #t~nondet4; [L18] havoc #t~nondet4; [L19] havoc ~lk5~0; [L21] ~p6~0 := #t~nondet5; [L21] havoc #t~nondet5; [L22] havoc ~lk6~0; [L25] havoc ~cond~0; [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L25] int cond; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false;main_~cond~0 := main_#t~nondet6;havoc main_#t~nondet6; [?] assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; [?] assume !(0 != main_~p1~0); [?] assume !(0 != main_~p2~0); [?] assume !(0 != main_~p3~0); [?] assume !(0 != main_~p4~0); [?] assume !(0 != main_~p5~0); [?] assume !(0 != main_~p6~0); [?] assume !(0 != main_~p1~0); [?] assume !(0 != main_~p2~0); [?] assume !(0 != main_~p3~0); [?] assume !(0 != main_~p4~0); [?] assume !(0 != main_~p5~0); [?] assume !(0 != main_~p6~0); [L27-L102] assume !false; [L28] main_~cond~0 := main_#t~nondet6; [L28] havoc main_#t~nondet6; [L29-L31] assume !(0 == main_~cond~0); [L32] main_~lk1~0 := 0; [L34] main_~lk2~0 := 0; [L36] main_~lk3~0 := 0; [L38] main_~lk4~0 := 0; [L40] main_~lk5~0 := 0; [L42] main_~lk6~0 := 0; [L46-L48] assume !(0 != main_~p1~0); [L50-L52] assume !(0 != main_~p2~0); [L54-L56] assume !(0 != main_~p3~0); [L58-L60] assume !(0 != main_~p4~0); [L62-L64] assume !(0 != main_~p5~0); [L66-L68] assume !(0 != main_~p6~0); [L72-L75] assume !(0 != main_~p1~0); [L77-L80] assume !(0 != main_~p2~0); [L82-L85] assume !(0 != main_~p3~0); [L87-L90] assume !(0 != main_~p4~0); [L92-L95] assume !(0 != main_~p5~0); [L97-L100] assume !(0 != main_~p6~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L27-L102] assume !false; [L28] main_~cond~0 := main_#t~nondet6; [L28] havoc main_#t~nondet6; [L29-L31] assume !(0 == main_~cond~0); [L32] main_~lk1~0 := 0; [L34] main_~lk2~0 := 0; [L36] main_~lk3~0 := 0; [L38] main_~lk4~0 := 0; [L40] main_~lk5~0 := 0; [L42] main_~lk6~0 := 0; [L46-L48] assume !(0 != main_~p1~0); [L50-L52] assume !(0 != main_~p2~0); [L54-L56] assume !(0 != main_~p3~0); [L58-L60] assume !(0 != main_~p4~0); [L62-L64] assume !(0 != main_~p5~0); [L66-L68] assume !(0 != main_~p6~0); [L72-L75] assume !(0 != main_~p1~0); [L77-L80] assume !(0 != main_~p2~0); [L82-L85] assume !(0 != main_~p3~0); [L87-L90] assume !(0 != main_~p4~0); [L92-L95] assume !(0 != main_~p5~0); [L97-L100] assume !(0 != main_~p6~0); [L27-L102] COND FALSE !(false) [L28] main_~cond~0 := main_#t~nondet6; [L28] havoc main_#t~nondet6; [L29] COND FALSE !(0 == main_~cond~0) [L32] main_~lk1~0 := 0; [L34] main_~lk2~0 := 0; [L36] main_~lk3~0 := 0; [L38] main_~lk4~0 := 0; [L40] main_~lk5~0 := 0; [L42] main_~lk6~0 := 0; [L46] COND FALSE !(0 != main_~p1~0) [L50] COND FALSE !(0 != main_~p2~0) [L54] COND FALSE !(0 != main_~p3~0) [L58] COND FALSE !(0 != main_~p4~0) [L62] COND FALSE !(0 != main_~p5~0) [L66] COND FALSE !(0 != main_~p6~0) [L72] COND FALSE !(0 != main_~p1~0) [L77] COND FALSE !(0 != main_~p2~0) [L82] COND FALSE !(0 != main_~p3~0) [L87] COND FALSE !(0 != main_~p4~0) [L92] COND FALSE !(0 != main_~p5~0) [L97] COND FALSE !(0 != main_~p6~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L27-L102] COND FALSE !(false) [L28] main_~cond~0 := main_#t~nondet6; [L28] havoc main_#t~nondet6; [L29] COND FALSE !(0 == main_~cond~0) [L32] main_~lk1~0 := 0; [L34] main_~lk2~0 := 0; [L36] main_~lk3~0 := 0; [L38] main_~lk4~0 := 0; [L40] main_~lk5~0 := 0; [L42] main_~lk6~0 := 0; [L46] COND FALSE !(0 != main_~p1~0) [L50] COND FALSE !(0 != main_~p2~0) [L54] COND FALSE !(0 != main_~p3~0) [L58] COND FALSE !(0 != main_~p4~0) [L62] COND FALSE !(0 != main_~p5~0) [L66] COND FALSE !(0 != main_~p6~0) [L72] COND FALSE !(0 != main_~p1~0) [L77] COND FALSE !(0 != main_~p2~0) [L82] COND FALSE !(0 != main_~p3~0) [L87] COND FALSE !(0 != main_~p4~0) [L92] COND FALSE !(0 != main_~p5~0) [L97] COND FALSE !(0 != main_~p6~0) [L27-L102] COND FALSE !(false) [L28] ~cond~0 := #t~nondet6; [L28] havoc #t~nondet6; [L29] COND FALSE !(0 == ~cond~0) [L32] ~lk1~0 := 0; [L34] ~lk2~0 := 0; [L36] ~lk3~0 := 0; [L38] ~lk4~0 := 0; [L40] ~lk5~0 := 0; [L42] ~lk6~0 := 0; [L46] COND FALSE !(0 != ~p1~0) [L50] COND FALSE !(0 != ~p2~0) [L54] COND FALSE !(0 != ~p3~0) [L58] COND FALSE !(0 != ~p4~0) [L62] COND FALSE !(0 != ~p5~0) [L66] COND FALSE !(0 != ~p6~0) [L72] COND FALSE !(0 != ~p1~0) [L77] COND FALSE !(0 != ~p2~0) [L82] COND FALSE !(0 != ~p3~0) [L87] COND FALSE !(0 != ~p4~0) [L92] COND FALSE !(0 != ~p5~0) [L97] COND FALSE !(0 != ~p6~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L27-L102] COND FALSE !(false) [L28] ~cond~0 := #t~nondet6; [L28] havoc #t~nondet6; [L29] COND FALSE !(0 == ~cond~0) [L32] ~lk1~0 := 0; [L34] ~lk2~0 := 0; [L36] ~lk3~0 := 0; [L38] ~lk4~0 := 0; [L40] ~lk5~0 := 0; [L42] ~lk6~0 := 0; [L46] COND FALSE !(0 != ~p1~0) [L50] COND FALSE !(0 != ~p2~0) [L54] COND FALSE !(0 != ~p3~0) [L58] COND FALSE !(0 != ~p4~0) [L62] COND FALSE !(0 != ~p5~0) [L66] COND FALSE !(0 != ~p6~0) [L72] COND FALSE !(0 != ~p1~0) [L77] COND FALSE !(0 != ~p2~0) [L82] COND FALSE !(0 != ~p3~0) [L87] COND FALSE !(0 != ~p4~0) [L92] COND FALSE !(0 != ~p5~0) [L97] COND FALSE !(0 != ~p6~0) [L27] COND TRUE 1 [L28] cond = __VERIFIER_nondet_int() [L29] COND FALSE !(cond == 0) [L32] lk1 = 0 [L34] lk2 = 0 [L36] lk3 = 0 [L38] lk4 = 0 [L40] lk5 = 0 [L42] lk6 = 0 [L46] COND FALSE !(p1 != 0) [L50] COND FALSE !(p2 != 0) [L54] COND FALSE !(p3 != 0) [L58] COND FALSE !(p4 != 0) [L62] COND FALSE !(p5 != 0) [L66] COND FALSE !(p6 != 0) [L72] COND FALSE !(p1 != 0) [L77] COND FALSE !(p2 != 0) [L82] COND FALSE !(p3 != 0) [L87] COND FALSE !(p4 != 0) [L92] COND FALSE !(p5 != 0) [L97] COND FALSE !(p6 != 0) ----- [2018-11-22 23:56:57,137 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_643dd833-9011-43c3-a71e-678fdead7ba5/bin-2019/uautomizer/witness.graphml [2018-11-22 23:56:57,138 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 23:56:57,138 INFO L168 Benchmark]: Toolchain (without parser) took 1120.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -98.7 MB). Peak memory consumption was 60.2 MB. Max. memory is 11.5 GB. [2018-11-22 23:56:57,139 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:56:57,139 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.42 ms. Allocated memory is still 1.0 GB. Free memory was 953.7 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:56:57,139 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.47 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:56:57,140 INFO L168 Benchmark]: Boogie Preprocessor took 50.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -211.9 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-22 23:56:57,140 INFO L168 Benchmark]: RCFGBuilder took 232.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-22 23:56:57,140 INFO L168 Benchmark]: BuchiAutomizer took 608.39 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: 81.9 MB). Peak memory consumption was 81.9 MB. Max. memory is 11.5 GB. [2018-11-22 23:56:57,141 INFO L168 Benchmark]: Witness Printer took 46.57 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-22 23:56:57,143 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 159.42 ms. Allocated memory is still 1.0 GB. Free memory was 953.7 MB in the beginning and 943.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 20.47 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -211.9 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 232.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 608.39 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: 81.9 MB). Peak memory consumption was 81.9 MB. Max. memory is 11.5 GB. * Witness Printer took 46.57 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (5 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.5 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 561 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.5s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 0.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 561 states and ocurred in iteration 5. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 251 SDtfs, 130 SDslu, 144 SDs, 0 SdLazy, 25 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI5 SFLT0 conc0 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: 27]: 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 {p1=0, \result=0, p3=0, p2=0, p5=0, p4=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1f0a15bf=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5840de58=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@eb26f6d=0, lk5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@746b42f2=1, lk6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@59e3ddc3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7e950623=0, lk1=0, lk2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@175dbfc6=0, cond=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 27]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;havoc main_~cond~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L25] havoc main_~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L25] havoc main_~cond~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L25] havoc main_~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L25] havoc main_~cond~0; [L6] ~p1~0 := #t~nondet0; [L6] havoc #t~nondet0; [L7] havoc ~lk1~0; [L9] ~p2~0 := #t~nondet1; [L9] havoc #t~nondet1; [L10] havoc ~lk2~0; [L12] ~p3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] havoc ~lk3~0; [L15] ~p4~0 := #t~nondet3; [L15] havoc #t~nondet3; [L16] havoc ~lk4~0; [L18] ~p5~0 := #t~nondet4; [L18] havoc #t~nondet4; [L19] havoc ~lk5~0; [L21] ~p6~0 := #t~nondet5; [L21] havoc #t~nondet5; [L22] havoc ~lk6~0; [L25] havoc ~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] ~p1~0 := #t~nondet0; [L6] havoc #t~nondet0; [L7] havoc ~lk1~0; [L9] ~p2~0 := #t~nondet1; [L9] havoc #t~nondet1; [L10] havoc ~lk2~0; [L12] ~p3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] havoc ~lk3~0; [L15] ~p4~0 := #t~nondet3; [L15] havoc #t~nondet3; [L16] havoc ~lk4~0; [L18] ~p5~0 := #t~nondet4; [L18] havoc #t~nondet4; [L19] havoc ~lk5~0; [L21] ~p6~0 := #t~nondet5; [L21] havoc #t~nondet5; [L22] havoc ~lk6~0; [L25] havoc ~cond~0; [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L25] int cond; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false;main_~cond~0 := main_#t~nondet6;havoc main_#t~nondet6; [?] assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; [?] assume !(0 != main_~p1~0); [?] assume !(0 != main_~p2~0); [?] assume !(0 != main_~p3~0); [?] assume !(0 != main_~p4~0); [?] assume !(0 != main_~p5~0); [?] assume !(0 != main_~p6~0); [?] assume !(0 != main_~p1~0); [?] assume !(0 != main_~p2~0); [?] assume !(0 != main_~p3~0); [?] assume !(0 != main_~p4~0); [?] assume !(0 != main_~p5~0); [?] assume !(0 != main_~p6~0); [L27-L102] assume !false; [L28] main_~cond~0 := main_#t~nondet6; [L28] havoc main_#t~nondet6; [L29-L31] assume !(0 == main_~cond~0); [L32] main_~lk1~0 := 0; [L34] main_~lk2~0 := 0; [L36] main_~lk3~0 := 0; [L38] main_~lk4~0 := 0; [L40] main_~lk5~0 := 0; [L42] main_~lk6~0 := 0; [L46-L48] assume !(0 != main_~p1~0); [L50-L52] assume !(0 != main_~p2~0); [L54-L56] assume !(0 != main_~p3~0); [L58-L60] assume !(0 != main_~p4~0); [L62-L64] assume !(0 != main_~p5~0); [L66-L68] assume !(0 != main_~p6~0); [L72-L75] assume !(0 != main_~p1~0); [L77-L80] assume !(0 != main_~p2~0); [L82-L85] assume !(0 != main_~p3~0); [L87-L90] assume !(0 != main_~p4~0); [L92-L95] assume !(0 != main_~p5~0); [L97-L100] assume !(0 != main_~p6~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L27-L102] assume !false; [L28] main_~cond~0 := main_#t~nondet6; [L28] havoc main_#t~nondet6; [L29-L31] assume !(0 == main_~cond~0); [L32] main_~lk1~0 := 0; [L34] main_~lk2~0 := 0; [L36] main_~lk3~0 := 0; [L38] main_~lk4~0 := 0; [L40] main_~lk5~0 := 0; [L42] main_~lk6~0 := 0; [L46-L48] assume !(0 != main_~p1~0); [L50-L52] assume !(0 != main_~p2~0); [L54-L56] assume !(0 != main_~p3~0); [L58-L60] assume !(0 != main_~p4~0); [L62-L64] assume !(0 != main_~p5~0); [L66-L68] assume !(0 != main_~p6~0); [L72-L75] assume !(0 != main_~p1~0); [L77-L80] assume !(0 != main_~p2~0); [L82-L85] assume !(0 != main_~p3~0); [L87-L90] assume !(0 != main_~p4~0); [L92-L95] assume !(0 != main_~p5~0); [L97-L100] assume !(0 != main_~p6~0); [L27-L102] COND FALSE !(false) [L28] main_~cond~0 := main_#t~nondet6; [L28] havoc main_#t~nondet6; [L29] COND FALSE !(0 == main_~cond~0) [L32] main_~lk1~0 := 0; [L34] main_~lk2~0 := 0; [L36] main_~lk3~0 := 0; [L38] main_~lk4~0 := 0; [L40] main_~lk5~0 := 0; [L42] main_~lk6~0 := 0; [L46] COND FALSE !(0 != main_~p1~0) [L50] COND FALSE !(0 != main_~p2~0) [L54] COND FALSE !(0 != main_~p3~0) [L58] COND FALSE !(0 != main_~p4~0) [L62] COND FALSE !(0 != main_~p5~0) [L66] COND FALSE !(0 != main_~p6~0) [L72] COND FALSE !(0 != main_~p1~0) [L77] COND FALSE !(0 != main_~p2~0) [L82] COND FALSE !(0 != main_~p3~0) [L87] COND FALSE !(0 != main_~p4~0) [L92] COND FALSE !(0 != main_~p5~0) [L97] COND FALSE !(0 != main_~p6~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L27-L102] COND FALSE !(false) [L28] main_~cond~0 := main_#t~nondet6; [L28] havoc main_#t~nondet6; [L29] COND FALSE !(0 == main_~cond~0) [L32] main_~lk1~0 := 0; [L34] main_~lk2~0 := 0; [L36] main_~lk3~0 := 0; [L38] main_~lk4~0 := 0; [L40] main_~lk5~0 := 0; [L42] main_~lk6~0 := 0; [L46] COND FALSE !(0 != main_~p1~0) [L50] COND FALSE !(0 != main_~p2~0) [L54] COND FALSE !(0 != main_~p3~0) [L58] COND FALSE !(0 != main_~p4~0) [L62] COND FALSE !(0 != main_~p5~0) [L66] COND FALSE !(0 != main_~p6~0) [L72] COND FALSE !(0 != main_~p1~0) [L77] COND FALSE !(0 != main_~p2~0) [L82] COND FALSE !(0 != main_~p3~0) [L87] COND FALSE !(0 != main_~p4~0) [L92] COND FALSE !(0 != main_~p5~0) [L97] COND FALSE !(0 != main_~p6~0) [L27-L102] COND FALSE !(false) [L28] ~cond~0 := #t~nondet6; [L28] havoc #t~nondet6; [L29] COND FALSE !(0 == ~cond~0) [L32] ~lk1~0 := 0; [L34] ~lk2~0 := 0; [L36] ~lk3~0 := 0; [L38] ~lk4~0 := 0; [L40] ~lk5~0 := 0; [L42] ~lk6~0 := 0; [L46] COND FALSE !(0 != ~p1~0) [L50] COND FALSE !(0 != ~p2~0) [L54] COND FALSE !(0 != ~p3~0) [L58] COND FALSE !(0 != ~p4~0) [L62] COND FALSE !(0 != ~p5~0) [L66] COND FALSE !(0 != ~p6~0) [L72] COND FALSE !(0 != ~p1~0) [L77] COND FALSE !(0 != ~p2~0) [L82] COND FALSE !(0 != ~p3~0) [L87] COND FALSE !(0 != ~p4~0) [L92] COND FALSE !(0 != ~p5~0) [L97] COND FALSE !(0 != ~p6~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L27-L102] COND FALSE !(false) [L28] ~cond~0 := #t~nondet6; [L28] havoc #t~nondet6; [L29] COND FALSE !(0 == ~cond~0) [L32] ~lk1~0 := 0; [L34] ~lk2~0 := 0; [L36] ~lk3~0 := 0; [L38] ~lk4~0 := 0; [L40] ~lk5~0 := 0; [L42] ~lk6~0 := 0; [L46] COND FALSE !(0 != ~p1~0) [L50] COND FALSE !(0 != ~p2~0) [L54] COND FALSE !(0 != ~p3~0) [L58] COND FALSE !(0 != ~p4~0) [L62] COND FALSE !(0 != ~p5~0) [L66] COND FALSE !(0 != ~p6~0) [L72] COND FALSE !(0 != ~p1~0) [L77] COND FALSE !(0 != ~p2~0) [L82] COND FALSE !(0 != ~p3~0) [L87] COND FALSE !(0 != ~p4~0) [L92] COND FALSE !(0 != ~p5~0) [L97] COND FALSE !(0 != ~p6~0) [L27] COND TRUE 1 [L28] cond = __VERIFIER_nondet_int() [L29] COND FALSE !(cond == 0) [L32] lk1 = 0 [L34] lk2 = 0 [L36] lk3 = 0 [L38] lk4 = 0 [L40] lk5 = 0 [L42] lk6 = 0 [L46] COND FALSE !(p1 != 0) [L50] COND FALSE !(p2 != 0) [L54] COND FALSE !(p3 != 0) [L58] COND FALSE !(p4 != 0) [L62] COND FALSE !(p5 != 0) [L66] COND FALSE !(p6 != 0) [L72] COND FALSE !(p1 != 0) [L77] COND FALSE !(p2 != 0) [L82] COND FALSE !(p3 != 0) [L87] COND FALSE !(p4 != 0) [L92] COND FALSE !(p5 != 0) [L97] COND FALSE !(p6 != 0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0;main_~p1~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet4;havoc main_#t~nondet4;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet5;havoc main_#t~nondet5;havoc main_~lk6~0;havoc main_~cond~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L25] havoc main_~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L25] havoc main_~cond~0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L25] havoc main_~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~cond~0; [L6] main_~p1~0 := main_#t~nondet0; [L6] havoc main_#t~nondet0; [L7] havoc main_~lk1~0; [L9] main_~p2~0 := main_#t~nondet1; [L9] havoc main_#t~nondet1; [L10] havoc main_~lk2~0; [L12] main_~p3~0 := main_#t~nondet2; [L12] havoc main_#t~nondet2; [L13] havoc main_~lk3~0; [L15] main_~p4~0 := main_#t~nondet3; [L15] havoc main_#t~nondet3; [L16] havoc main_~lk4~0; [L18] main_~p5~0 := main_#t~nondet4; [L18] havoc main_#t~nondet4; [L19] havoc main_~lk5~0; [L21] main_~p6~0 := main_#t~nondet5; [L21] havoc main_#t~nondet5; [L22] havoc main_~lk6~0; [L25] havoc main_~cond~0; [L6] ~p1~0 := #t~nondet0; [L6] havoc #t~nondet0; [L7] havoc ~lk1~0; [L9] ~p2~0 := #t~nondet1; [L9] havoc #t~nondet1; [L10] havoc ~lk2~0; [L12] ~p3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] havoc ~lk3~0; [L15] ~p4~0 := #t~nondet3; [L15] havoc #t~nondet3; [L16] havoc ~lk4~0; [L18] ~p5~0 := #t~nondet4; [L18] havoc #t~nondet4; [L19] havoc ~lk5~0; [L21] ~p6~0 := #t~nondet5; [L21] havoc #t~nondet5; [L22] havoc ~lk6~0; [L25] havoc ~cond~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] ~p1~0 := #t~nondet0; [L6] havoc #t~nondet0; [L7] havoc ~lk1~0; [L9] ~p2~0 := #t~nondet1; [L9] havoc #t~nondet1; [L10] havoc ~lk2~0; [L12] ~p3~0 := #t~nondet2; [L12] havoc #t~nondet2; [L13] havoc ~lk3~0; [L15] ~p4~0 := #t~nondet3; [L15] havoc #t~nondet3; [L16] havoc ~lk4~0; [L18] ~p5~0 := #t~nondet4; [L18] havoc #t~nondet4; [L19] havoc ~lk5~0; [L21] ~p6~0 := #t~nondet5; [L21] havoc #t~nondet5; [L22] havoc ~lk6~0; [L25] havoc ~cond~0; [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L25] int cond; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false;main_~cond~0 := main_#t~nondet6;havoc main_#t~nondet6; [?] assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0; [?] assume !(0 != main_~p1~0); [?] assume !(0 != main_~p2~0); [?] assume !(0 != main_~p3~0); [?] assume !(0 != main_~p4~0); [?] assume !(0 != main_~p5~0); [?] assume !(0 != main_~p6~0); [?] assume !(0 != main_~p1~0); [?] assume !(0 != main_~p2~0); [?] assume !(0 != main_~p3~0); [?] assume !(0 != main_~p4~0); [?] assume !(0 != main_~p5~0); [?] assume !(0 != main_~p6~0); [L27-L102] assume !false; [L28] main_~cond~0 := main_#t~nondet6; [L28] havoc main_#t~nondet6; [L29-L31] assume !(0 == main_~cond~0); [L32] main_~lk1~0 := 0; [L34] main_~lk2~0 := 0; [L36] main_~lk3~0 := 0; [L38] main_~lk4~0 := 0; [L40] main_~lk5~0 := 0; [L42] main_~lk6~0 := 0; [L46-L48] assume !(0 != main_~p1~0); [L50-L52] assume !(0 != main_~p2~0); [L54-L56] assume !(0 != main_~p3~0); [L58-L60] assume !(0 != main_~p4~0); [L62-L64] assume !(0 != main_~p5~0); [L66-L68] assume !(0 != main_~p6~0); [L72-L75] assume !(0 != main_~p1~0); [L77-L80] assume !(0 != main_~p2~0); [L82-L85] assume !(0 != main_~p3~0); [L87-L90] assume !(0 != main_~p4~0); [L92-L95] assume !(0 != main_~p5~0); [L97-L100] assume !(0 != main_~p6~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L27-L102] assume !false; [L28] main_~cond~0 := main_#t~nondet6; [L28] havoc main_#t~nondet6; [L29-L31] assume !(0 == main_~cond~0); [L32] main_~lk1~0 := 0; [L34] main_~lk2~0 := 0; [L36] main_~lk3~0 := 0; [L38] main_~lk4~0 := 0; [L40] main_~lk5~0 := 0; [L42] main_~lk6~0 := 0; [L46-L48] assume !(0 != main_~p1~0); [L50-L52] assume !(0 != main_~p2~0); [L54-L56] assume !(0 != main_~p3~0); [L58-L60] assume !(0 != main_~p4~0); [L62-L64] assume !(0 != main_~p5~0); [L66-L68] assume !(0 != main_~p6~0); [L72-L75] assume !(0 != main_~p1~0); [L77-L80] assume !(0 != main_~p2~0); [L82-L85] assume !(0 != main_~p3~0); [L87-L90] assume !(0 != main_~p4~0); [L92-L95] assume !(0 != main_~p5~0); [L97-L100] assume !(0 != main_~p6~0); [L27-L102] COND FALSE !(false) [L28] main_~cond~0 := main_#t~nondet6; [L28] havoc main_#t~nondet6; [L29] COND FALSE !(0 == main_~cond~0) [L32] main_~lk1~0 := 0; [L34] main_~lk2~0 := 0; [L36] main_~lk3~0 := 0; [L38] main_~lk4~0 := 0; [L40] main_~lk5~0 := 0; [L42] main_~lk6~0 := 0; [L46] COND FALSE !(0 != main_~p1~0) [L50] COND FALSE !(0 != main_~p2~0) [L54] COND FALSE !(0 != main_~p3~0) [L58] COND FALSE !(0 != main_~p4~0) [L62] COND FALSE !(0 != main_~p5~0) [L66] COND FALSE !(0 != main_~p6~0) [L72] COND FALSE !(0 != main_~p1~0) [L77] COND FALSE !(0 != main_~p2~0) [L82] COND FALSE !(0 != main_~p3~0) [L87] COND FALSE !(0 != main_~p4~0) [L92] COND FALSE !(0 != main_~p5~0) [L97] COND FALSE !(0 != main_~p6~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L27-L102] COND FALSE !(false) [L28] main_~cond~0 := main_#t~nondet6; [L28] havoc main_#t~nondet6; [L29] COND FALSE !(0 == main_~cond~0) [L32] main_~lk1~0 := 0; [L34] main_~lk2~0 := 0; [L36] main_~lk3~0 := 0; [L38] main_~lk4~0 := 0; [L40] main_~lk5~0 := 0; [L42] main_~lk6~0 := 0; [L46] COND FALSE !(0 != main_~p1~0) [L50] COND FALSE !(0 != main_~p2~0) [L54] COND FALSE !(0 != main_~p3~0) [L58] COND FALSE !(0 != main_~p4~0) [L62] COND FALSE !(0 != main_~p5~0) [L66] COND FALSE !(0 != main_~p6~0) [L72] COND FALSE !(0 != main_~p1~0) [L77] COND FALSE !(0 != main_~p2~0) [L82] COND FALSE !(0 != main_~p3~0) [L87] COND FALSE !(0 != main_~p4~0) [L92] COND FALSE !(0 != main_~p5~0) [L97] COND FALSE !(0 != main_~p6~0) [L27-L102] COND FALSE !(false) [L28] ~cond~0 := #t~nondet6; [L28] havoc #t~nondet6; [L29] COND FALSE !(0 == ~cond~0) [L32] ~lk1~0 := 0; [L34] ~lk2~0 := 0; [L36] ~lk3~0 := 0; [L38] ~lk4~0 := 0; [L40] ~lk5~0 := 0; [L42] ~lk6~0 := 0; [L46] COND FALSE !(0 != ~p1~0) [L50] COND FALSE !(0 != ~p2~0) [L54] COND FALSE !(0 != ~p3~0) [L58] COND FALSE !(0 != ~p4~0) [L62] COND FALSE !(0 != ~p5~0) [L66] COND FALSE !(0 != ~p6~0) [L72] COND FALSE !(0 != ~p1~0) [L77] COND FALSE !(0 != ~p2~0) [L82] COND FALSE !(0 != ~p3~0) [L87] COND FALSE !(0 != ~p4~0) [L92] COND FALSE !(0 != ~p5~0) [L97] COND FALSE !(0 != ~p6~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L27-L102] COND FALSE !(false) [L28] ~cond~0 := #t~nondet6; [L28] havoc #t~nondet6; [L29] COND FALSE !(0 == ~cond~0) [L32] ~lk1~0 := 0; [L34] ~lk2~0 := 0; [L36] ~lk3~0 := 0; [L38] ~lk4~0 := 0; [L40] ~lk5~0 := 0; [L42] ~lk6~0 := 0; [L46] COND FALSE !(0 != ~p1~0) [L50] COND FALSE !(0 != ~p2~0) [L54] COND FALSE !(0 != ~p3~0) [L58] COND FALSE !(0 != ~p4~0) [L62] COND FALSE !(0 != ~p5~0) [L66] COND FALSE !(0 != ~p6~0) [L72] COND FALSE !(0 != ~p1~0) [L77] COND FALSE !(0 != ~p2~0) [L82] COND FALSE !(0 != ~p3~0) [L87] COND FALSE !(0 != ~p4~0) [L92] COND FALSE !(0 != ~p5~0) [L97] COND FALSE !(0 != ~p6~0) [L27] COND TRUE 1 [L28] cond = __VERIFIER_nondet_int() [L29] COND FALSE !(cond == 0) [L32] lk1 = 0 [L34] lk2 = 0 [L36] lk3 = 0 [L38] lk4 = 0 [L40] lk5 = 0 [L42] lk6 = 0 [L46] COND FALSE !(p1 != 0) [L50] COND FALSE !(p2 != 0) [L54] COND FALSE !(p3 != 0) [L58] COND FALSE !(p4 != 0) [L62] COND FALSE !(p5 != 0) [L66] COND FALSE !(p6 != 0) [L72] COND FALSE !(p1 != 0) [L77] COND FALSE !(p2 != 0) [L82] COND FALSE !(p3 != 0) [L87] COND FALSE !(p4 != 0) [L92] COND FALSE !(p5 != 0) [L97] COND FALSE !(p6 != 0) ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L25] int cond; Loop: [L27] COND TRUE 1 [L28] cond = __VERIFIER_nondet_int() [L29] COND FALSE !(cond == 0) [L32] lk1 = 0 [L34] lk2 = 0 [L36] lk3 = 0 [L38] lk4 = 0 [L40] lk5 = 0 [L42] lk6 = 0 [L46] COND FALSE !(p1 != 0) [L50] COND FALSE !(p2 != 0) [L54] COND FALSE !(p3 != 0) [L58] COND FALSE !(p4 != 0) [L62] COND FALSE !(p5 != 0) [L66] COND FALSE !(p6 != 0) [L72] COND FALSE !(p1 != 0) [L77] COND FALSE !(p2 != 0) [L82] COND FALSE !(p3 != 0) [L87] COND FALSE !(p4 != 0) [L92] COND FALSE !(p5 != 0) [L97] COND FALSE !(p6 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...