./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_8_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_c659a199-702f-4e74-af5d-e720e1cfe0f9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c659a199-702f-4e74-af5d-e720e1cfe0f9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c659a199-702f-4e74-af5d-e720e1cfe0f9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c659a199-702f-4e74-af5d-e720e1cfe0f9/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c659a199-702f-4e74-af5d-e720e1cfe0f9/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c659a199-702f-4e74-af5d-e720e1cfe0f9/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 f2cbbf56a13532141372a32a461d64a9d1351c0e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-23 01:39:57,040 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:39:57,042 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:39:57,049 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:39:57,049 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:39:57,050 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:39:57,050 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:39:57,051 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:39:57,053 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:39:57,053 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:39:57,054 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:39:57,054 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:39:57,055 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:39:57,056 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:39:57,056 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:39:57,057 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:39:57,057 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:39:57,059 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:39:57,060 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:39:57,061 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:39:57,063 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:39:57,063 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:39:57,065 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:39:57,065 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:39:57,066 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:39:57,066 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:39:57,067 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:39:57,067 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:39:57,068 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:39:57,069 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:39:57,069 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:39:57,070 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:39:57,070 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:39:57,070 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:39:57,071 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:39:57,071 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:39:57,071 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c659a199-702f-4e74-af5d-e720e1cfe0f9/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 01:39:57,083 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:39:57,083 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:39:57,084 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 01:39:57,084 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 01:39:57,084 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 01:39:57,084 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 01:39:57,085 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 01:39:57,085 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 01:39:57,085 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 01:39:57,086 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 01:39:57,086 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 01:39:57,086 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:39:57,086 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:39:57,086 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 01:39:57,086 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:39:57,086 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:39:57,087 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:39:57,087 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 01:39:57,087 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 01:39:57,087 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 01:39:57,087 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:39:57,087 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:39:57,087 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 01:39:57,087 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:39:57,088 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 01:39:57,088 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:39:57,088 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 01:39:57,088 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 01:39:57,088 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:39:57,088 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 01:39:57,088 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 01:39:57,089 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 01:39:57,089 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_c659a199-702f-4e74-af5d-e720e1cfe0f9/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 -> f2cbbf56a13532141372a32a461d64a9d1351c0e [2018-11-23 01:39:57,113 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:39:57,123 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:39:57,125 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:39:57,126 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:39:57,127 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:39:57,127 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c659a199-702f-4e74-af5d-e720e1cfe0f9/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 01:39:57,170 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c659a199-702f-4e74-af5d-e720e1cfe0f9/bin-2019/uautomizer/data/b9b59f95e/3134cf51927640b98b33e718ee7d1f18/FLAG42e2641b8 [2018-11-23 01:39:57,578 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:39:57,578 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c659a199-702f-4e74-af5d-e720e1cfe0f9/sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 01:39:57,583 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c659a199-702f-4e74-af5d-e720e1cfe0f9/bin-2019/uautomizer/data/b9b59f95e/3134cf51927640b98b33e718ee7d1f18/FLAG42e2641b8 [2018-11-23 01:39:57,594 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c659a199-702f-4e74-af5d-e720e1cfe0f9/bin-2019/uautomizer/data/b9b59f95e/3134cf51927640b98b33e718ee7d1f18 [2018-11-23 01:39:57,597 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:39:57,599 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:39:57,599 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:39:57,600 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:39:57,603 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:39:57,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:39:57" (1/1) ... [2018-11-23 01:39:57,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e234a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:39:57, skipping insertion in model container [2018-11-23 01:39:57,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:39:57" (1/1) ... [2018-11-23 01:39:57,615 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:39:57,633 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:39:57,775 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:39:57,777 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:39:57,792 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:39:57,800 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:39:57,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:39:57 WrapperNode [2018-11-23 01:39:57,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:39:57,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:39:57,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:39:57,802 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:39:57,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:39:57" (1/1) ... [2018-11-23 01:39:57,810 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:39:57" (1/1) ... [2018-11-23 01:39:57,823 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:39:57,823 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:39:57,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:39:57,823 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:39:57,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:39:57" (1/1) ... [2018-11-23 01:39:57,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:39:57" (1/1) ... [2018-11-23 01:39:57,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:39:57" (1/1) ... [2018-11-23 01:39:57,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:39:57" (1/1) ... [2018-11-23 01:39:57,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:39:57" (1/1) ... [2018-11-23 01:39:57,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:39:57" (1/1) ... [2018-11-23 01:39:57,870 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:39:57" (1/1) ... [2018-11-23 01:39:57,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:39:57,872 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:39:57,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:39:57,872 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:39:57,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:39:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c659a199-702f-4e74-af5d-e720e1cfe0f9/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-23 01:39:57,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:39:57,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:39:58,052 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:39:58,052 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 01:39:58,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:39:58 BoogieIcfgContainer [2018-11-23 01:39:58,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:39:58,053 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 01:39:58,053 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 01:39:58,056 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 01:39:58,057 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 01:39:58,057 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 01:39:57" (1/3) ... [2018-11-23 01:39:58,058 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c2466d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:39:58, skipping insertion in model container [2018-11-23 01:39:58,058 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 01:39:58,058 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:39:57" (2/3) ... [2018-11-23 01:39:58,059 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c2466d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:39:58, skipping insertion in model container [2018-11-23 01:39:58,059 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 01:39:58,059 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:39:58" (3/3) ... [2018-11-23 01:39:58,060 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 01:39:58,097 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 01:39:58,097 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 01:39:58,097 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 01:39:58,098 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 01:39:58,098 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 01:39:58,098 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 01:39:58,098 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 01:39:58,098 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 01:39:58,098 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 01:39:58,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-11-23 01:39:58,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-23 01:39:58,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:39:58,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:39:58,128 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 01:39:58,128 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:39:58,128 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 01:39:58,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-11-23 01:39:58,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-23 01:39:58,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:39:58,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:39:58,131 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 01:39:58,131 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:39:58,137 INFO L794 eck$LassoCheckResult]: Stem: 29#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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;havoc main_~cond~0; 23#L125-1true [2018-11-23 01:39:58,138 INFO L796 eck$LassoCheckResult]: Loop: 23#L125-1true assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 31#L35true 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;main_~lk7~0 := 0;main_~lk8~0 := 0; 17#L56true assume 0 != main_~p1~0;main_~lk1~0 := 1; 14#L56-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 5#L60-1true assume !(0 != main_~p3~0); 27#L64-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 32#L68-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 24#L72-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 13#L76-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 3#L80-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 9#L84-1true assume !(0 != main_~p1~0); 33#L90-1true assume !(0 != main_~p2~0); 10#L95-1true assume !(0 != main_~p3~0); 20#L100-1true assume !(0 != main_~p4~0); 25#L105-1true assume !(0 != main_~p5~0); 30#L110-1true assume !(0 != main_~p6~0); 7#L115-1true assume !(0 != main_~p7~0); 16#L120-1true assume !(0 != main_~p8~0); 23#L125-1true [2018-11-23 01:39:58,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:39:58,142 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-11-23 01:39:58,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:39:58,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:39:58,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:39:58,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:39:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:39:58,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:39:58,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1556343304, now seen corresponding path program 1 times [2018-11-23 01:39:58,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:39:58,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:39:58,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:39:58,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:39:58,253 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-23 01:39:58,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:39:58,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:39:58,257 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 01:39:58,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:39:58,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:39:58,268 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-11-23 01:39:58,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:39:58,294 INFO L93 Difference]: Finished difference Result 62 states and 105 transitions. [2018-11-23 01:39:58,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:39:58,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 105 transitions. [2018-11-23 01:39:58,298 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2018-11-23 01:39:58,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 52 states and 82 transitions. [2018-11-23 01:39:58,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-11-23 01:39:58,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2018-11-23 01:39:58,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 82 transitions. [2018-11-23 01:39:58,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 01:39:58,305 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 82 transitions. [2018-11-23 01:39:58,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 82 transitions. [2018-11-23 01:39:58,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-23 01:39:58,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 01:39:58,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 82 transitions. [2018-11-23 01:39:58,329 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 82 transitions. [2018-11-23 01:39:58,329 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 82 transitions. [2018-11-23 01:39:58,330 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 01:39:58,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 82 transitions. [2018-11-23 01:39:58,332 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2018-11-23 01:39:58,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:39:58,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:39:58,333 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 01:39:58,333 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:39:58,333 INFO L794 eck$LassoCheckResult]: Stem: 131#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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;havoc main_~cond~0; 118#L125-1 [2018-11-23 01:39:58,333 INFO L796 eck$LassoCheckResult]: Loop: 118#L125-1 assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 126#L35 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;main_~lk7~0 := 0;main_~lk8~0 := 0; 136#L56 assume !(0 != main_~p1~0); 137#L56-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 154#L60-1 assume !(0 != main_~p3~0); 153#L64-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 152#L68-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 151#L72-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 150#L76-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 148#L80-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 134#L84-1 assume !(0 != main_~p1~0); 135#L90-1 assume !(0 != main_~p2~0); 147#L95-1 assume !(0 != main_~p3~0); 145#L100-1 assume !(0 != main_~p4~0); 128#L105-1 assume !(0 != main_~p5~0); 106#L110-1 assume !(0 != main_~p6~0); 141#L115-1 assume !(0 != main_~p7~0); 122#L120-1 assume !(0 != main_~p8~0); 118#L125-1 [2018-11-23 01:39:58,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:39:58,334 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2018-11-23 01:39:58,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:39:58,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:39:58,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:39:58,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:39:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:39:58,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:39:58,339 INFO L82 PathProgramCache]: Analyzing trace with hash 535274950, now seen corresponding path program 1 times [2018-11-23 01:39:58,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:39:58,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:39:58,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:39:58,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:39:58,375 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-23 01:39:58,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:39:58,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:39:58,376 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 01:39:58,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:39:58,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:39:58,376 INFO L87 Difference]: Start difference. First operand 52 states and 82 transitions. cyclomatic complexity: 32 Second operand 3 states. [2018-11-23 01:39:58,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:39:58,389 INFO L93 Difference]: Finished difference Result 101 states and 157 transitions. [2018-11-23 01:39:58,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:39:58,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 157 transitions. [2018-11-23 01:39:58,391 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2018-11-23 01:39:58,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 157 transitions. [2018-11-23 01:39:58,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2018-11-23 01:39:58,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2018-11-23 01:39:58,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 157 transitions. [2018-11-23 01:39:58,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 01:39:58,393 INFO L705 BuchiCegarLoop]: Abstraction has 101 states and 157 transitions. [2018-11-23 01:39:58,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 157 transitions. [2018-11-23 01:39:58,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-11-23 01:39:58,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-23 01:39:58,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 157 transitions. [2018-11-23 01:39:58,399 INFO L728 BuchiCegarLoop]: Abstraction has 101 states and 157 transitions. [2018-11-23 01:39:58,399 INFO L608 BuchiCegarLoop]: Abstraction has 101 states and 157 transitions. [2018-11-23 01:39:58,399 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 01:39:58,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 157 transitions. [2018-11-23 01:39:58,400 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2018-11-23 01:39:58,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:39:58,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:39:58,400 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 01:39:58,400 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:39:58,400 INFO L794 eck$LassoCheckResult]: Stem: 292#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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;havoc main_~cond~0; 293#L125-1 [2018-11-23 01:39:58,400 INFO L796 eck$LassoCheckResult]: Loop: 293#L125-1 assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 335#L35 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;main_~lk7~0 := 0;main_~lk8~0 := 0; 334#L56 assume !(0 != main_~p1~0); 333#L56-2 assume !(0 != main_~p2~0); 332#L60-1 assume !(0 != main_~p3~0); 323#L64-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 324#L68-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 313#L72-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 314#L76-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 307#L80-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 308#L84-1 assume !(0 != main_~p1~0); 331#L90-1 assume !(0 != main_~p2~0); 327#L95-1 assume !(0 != main_~p3~0); 326#L100-1 assume !(0 != main_~p4~0); 317#L105-1 assume !(0 != main_~p5~0); 316#L110-1 assume !(0 != main_~p6~0); 339#L115-1 assume !(0 != main_~p7~0); 337#L120-1 assume !(0 != main_~p8~0); 293#L125-1 [2018-11-23 01:39:58,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:39:58,401 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2018-11-23 01:39:58,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:39:58,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:39:58,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:39:58,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:39:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:39:58,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:39:58,403 INFO L82 PathProgramCache]: Analyzing trace with hash -744588728, now seen corresponding path program 1 times [2018-11-23 01:39:58,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:39:58,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:39:58,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:39:58,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:39:58,427 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-23 01:39:58,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:39:58,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:39:58,428 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 01:39:58,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:39:58,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:39:58,428 INFO L87 Difference]: Start difference. First operand 101 states and 157 transitions. cyclomatic complexity: 60 Second operand 3 states. [2018-11-23 01:39:58,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:39:58,448 INFO L93 Difference]: Finished difference Result 197 states and 301 transitions. [2018-11-23 01:39:58,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:39:58,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 197 states and 301 transitions. [2018-11-23 01:39:58,451 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2018-11-23 01:39:58,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 197 states to 197 states and 301 transitions. [2018-11-23 01:39:58,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 197 [2018-11-23 01:39:58,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 197 [2018-11-23 01:39:58,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 197 states and 301 transitions. [2018-11-23 01:39:58,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 01:39:58,454 INFO L705 BuchiCegarLoop]: Abstraction has 197 states and 301 transitions. [2018-11-23 01:39:58,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states and 301 transitions. [2018-11-23 01:39:58,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-11-23 01:39:58,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-23 01:39:58,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 301 transitions. [2018-11-23 01:39:58,466 INFO L728 BuchiCegarLoop]: Abstraction has 197 states and 301 transitions. [2018-11-23 01:39:58,466 INFO L608 BuchiCegarLoop]: Abstraction has 197 states and 301 transitions. [2018-11-23 01:39:58,466 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 01:39:58,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 197 states and 301 transitions. [2018-11-23 01:39:58,468 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2018-11-23 01:39:58,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:39:58,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:39:58,468 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 01:39:58,468 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:39:58,468 INFO L794 eck$LassoCheckResult]: Stem: 599#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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;havoc main_~cond~0; 600#L125-1 [2018-11-23 01:39:58,469 INFO L796 eck$LassoCheckResult]: Loop: 600#L125-1 assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 628#L35 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;main_~lk7~0 := 0;main_~lk8~0 := 0; 625#L56 assume !(0 != main_~p1~0); 626#L56-2 assume !(0 != main_~p2~0); 673#L60-1 assume !(0 != main_~p3~0); 670#L64-1 assume !(0 != main_~p4~0); 668#L68-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 666#L72-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 664#L76-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 662#L80-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 660#L84-1 assume !(0 != main_~p1~0); 657#L90-1 assume !(0 != main_~p2~0); 654#L95-1 assume !(0 != main_~p3~0); 649#L100-1 assume !(0 != main_~p4~0); 646#L105-1 assume !(0 != main_~p5~0); 641#L110-1 assume !(0 != main_~p6~0); 638#L115-1 assume !(0 != main_~p7~0); 632#L120-1 assume !(0 != main_~p8~0); 600#L125-1 [2018-11-23 01:39:58,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:39:58,469 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2018-11-23 01:39:58,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:39:58,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:39:58,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:39:58,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:39:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:39:58,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:39:58,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1331394742, now seen corresponding path program 1 times [2018-11-23 01:39:58,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:39:58,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:39:58,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:39:58,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:39:58,495 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-23 01:39:58,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:39:58,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:39:58,495 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 01:39:58,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:39:58,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:39:58,496 INFO L87 Difference]: Start difference. First operand 197 states and 301 transitions. cyclomatic complexity: 112 Second operand 3 states. [2018-11-23 01:39:58,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:39:58,531 INFO L93 Difference]: Finished difference Result 385 states and 577 transitions. [2018-11-23 01:39:58,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:39:58,531 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 385 states and 577 transitions. [2018-11-23 01:39:58,534 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2018-11-23 01:39:58,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 385 states to 385 states and 577 transitions. [2018-11-23 01:39:58,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 385 [2018-11-23 01:39:58,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 385 [2018-11-23 01:39:58,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 385 states and 577 transitions. [2018-11-23 01:39:58,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 01:39:58,539 INFO L705 BuchiCegarLoop]: Abstraction has 385 states and 577 transitions. [2018-11-23 01:39:58,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states and 577 transitions. [2018-11-23 01:39:58,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2018-11-23 01:39:58,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-11-23 01:39:58,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 577 transitions. [2018-11-23 01:39:58,554 INFO L728 BuchiCegarLoop]: Abstraction has 385 states and 577 transitions. [2018-11-23 01:39:58,555 INFO L608 BuchiCegarLoop]: Abstraction has 385 states and 577 transitions. [2018-11-23 01:39:58,555 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 01:39:58,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 385 states and 577 transitions. [2018-11-23 01:39:58,557 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2018-11-23 01:39:58,557 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:39:58,557 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:39:58,557 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 01:39:58,557 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:39:58,558 INFO L794 eck$LassoCheckResult]: Stem: 1186#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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;havoc main_~cond~0; 1187#L125-1 [2018-11-23 01:39:58,558 INFO L796 eck$LassoCheckResult]: Loop: 1187#L125-1 assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 1232#L35 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;main_~lk7~0 := 0;main_~lk8~0 := 0; 1230#L56 assume !(0 != main_~p1~0); 1226#L56-2 assume !(0 != main_~p2~0); 1224#L60-1 assume !(0 != main_~p3~0); 1220#L64-1 assume !(0 != main_~p4~0); 1216#L68-1 assume !(0 != main_~p5~0); 1214#L72-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1212#L76-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1210#L80-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1207#L84-1 assume !(0 != main_~p1~0); 1208#L90-1 assume !(0 != main_~p2~0); 1256#L95-1 assume !(0 != main_~p3~0); 1251#L100-1 assume !(0 != main_~p4~0); 1247#L105-1 assume !(0 != main_~p5~0); 1243#L110-1 assume !(0 != main_~p6~0); 1240#L115-1 assume !(0 != main_~p7~0); 1236#L120-1 assume !(0 != main_~p8~0); 1187#L125-1 [2018-11-23 01:39:58,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:39:58,558 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2018-11-23 01:39:58,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:39:58,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:39:58,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:39:58,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:39:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:39:58,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:39:58,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1073229304, now seen corresponding path program 1 times [2018-11-23 01:39:58,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:39:58,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:39:58,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:39:58,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:39:58,600 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-23 01:39:58,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:39:58,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:39:58,601 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 01:39:58,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:39:58,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:39:58,601 INFO L87 Difference]: Start difference. First operand 385 states and 577 transitions. cyclomatic complexity: 208 Second operand 3 states. [2018-11-23 01:39:58,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:39:58,614 INFO L93 Difference]: Finished difference Result 753 states and 1105 transitions. [2018-11-23 01:39:58,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:39:58,615 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 753 states and 1105 transitions. [2018-11-23 01:39:58,620 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2018-11-23 01:39:58,624 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 753 states to 753 states and 1105 transitions. [2018-11-23 01:39:58,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 753 [2018-11-23 01:39:58,625 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 753 [2018-11-23 01:39:58,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 753 states and 1105 transitions. [2018-11-23 01:39:58,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 01:39:58,627 INFO L705 BuchiCegarLoop]: Abstraction has 753 states and 1105 transitions. [2018-11-23 01:39:58,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states and 1105 transitions. [2018-11-23 01:39:58,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 753. [2018-11-23 01:39:58,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-11-23 01:39:58,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1105 transitions. [2018-11-23 01:39:58,645 INFO L728 BuchiCegarLoop]: Abstraction has 753 states and 1105 transitions. [2018-11-23 01:39:58,645 INFO L608 BuchiCegarLoop]: Abstraction has 753 states and 1105 transitions. [2018-11-23 01:39:58,645 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 01:39:58,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 753 states and 1105 transitions. [2018-11-23 01:39:58,648 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2018-11-23 01:39:58,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:39:58,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:39:58,649 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 01:39:58,649 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:39:58,649 INFO L794 eck$LassoCheckResult]: Stem: 2335#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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;havoc main_~cond~0; 2336#L125-1 [2018-11-23 01:39:58,649 INFO L796 eck$LassoCheckResult]: Loop: 2336#L125-1 assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 2400#L35 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;main_~lk7~0 := 0;main_~lk8~0 := 0; 2398#L56 assume !(0 != main_~p1~0); 2394#L56-2 assume !(0 != main_~p2~0); 2392#L60-1 assume !(0 != main_~p3~0); 2388#L64-1 assume !(0 != main_~p4~0); 2384#L68-1 assume !(0 != main_~p5~0); 2380#L72-1 assume !(0 != main_~p6~0); 2378#L76-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2376#L80-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2373#L84-1 assume !(0 != main_~p1~0); 2374#L90-1 assume !(0 != main_~p2~0); 2424#L95-1 assume !(0 != main_~p3~0); 2419#L100-1 assume !(0 != main_~p4~0); 2415#L105-1 assume !(0 != main_~p5~0); 2411#L110-1 assume !(0 != main_~p6~0); 2408#L115-1 assume !(0 != main_~p7~0); 2404#L120-1 assume !(0 != main_~p8~0); 2336#L125-1 [2018-11-23 01:39:58,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:39:58,650 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2018-11-23 01:39:58,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:39:58,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:39:58,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:39:58,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:39:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:39:58,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:39:58,654 INFO L82 PathProgramCache]: Analyzing trace with hash -372164726, now seen corresponding path program 1 times [2018-11-23 01:39:58,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:39:58,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:39:58,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:39:58,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:39:58,688 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-23 01:39:58,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:39:58,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:39:58,689 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 01:39:58,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:39:58,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:39:58,689 INFO L87 Difference]: Start difference. First operand 753 states and 1105 transitions. cyclomatic complexity: 384 Second operand 3 states. [2018-11-23 01:39:58,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:39:58,719 INFO L93 Difference]: Finished difference Result 1473 states and 2113 transitions. [2018-11-23 01:39:58,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:39:58,719 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1473 states and 2113 transitions. [2018-11-23 01:39:58,731 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2018-11-23 01:39:58,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1473 states to 1473 states and 2113 transitions. [2018-11-23 01:39:58,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1473 [2018-11-23 01:39:58,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1473 [2018-11-23 01:39:58,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1473 states and 2113 transitions. [2018-11-23 01:39:58,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 01:39:58,742 INFO L705 BuchiCegarLoop]: Abstraction has 1473 states and 2113 transitions. [2018-11-23 01:39:58,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states and 2113 transitions. [2018-11-23 01:39:58,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1473. [2018-11-23 01:39:58,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1473 states. [2018-11-23 01:39:58,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 2113 transitions. [2018-11-23 01:39:58,768 INFO L728 BuchiCegarLoop]: Abstraction has 1473 states and 2113 transitions. [2018-11-23 01:39:58,768 INFO L608 BuchiCegarLoop]: Abstraction has 1473 states and 2113 transitions. [2018-11-23 01:39:58,768 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 01:39:58,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1473 states and 2113 transitions. [2018-11-23 01:39:58,774 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2018-11-23 01:39:58,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:39:58,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:39:58,774 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 01:39:58,774 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:39:58,775 INFO L794 eck$LassoCheckResult]: Stem: 4563#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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;havoc main_~cond~0; 4564#L125-1 [2018-11-23 01:39:58,775 INFO L796 eck$LassoCheckResult]: Loop: 4564#L125-1 assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 4910#L35 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;main_~lk7~0 := 0;main_~lk8~0 := 0; 4907#L56 assume !(0 != main_~p1~0); 4903#L56-2 assume !(0 != main_~p2~0); 4900#L60-1 assume !(0 != main_~p3~0); 4897#L64-1 assume !(0 != main_~p4~0); 4898#L68-1 assume !(0 != main_~p5~0); 4889#L72-1 assume !(0 != main_~p6~0); 4891#L76-1 assume !(0 != main_~p7~0); 4929#L80-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4927#L84-1 assume !(0 != main_~p1~0); 4926#L90-1 assume !(0 != main_~p2~0); 4925#L95-1 assume !(0 != main_~p3~0); 4923#L100-1 assume !(0 != main_~p4~0); 4922#L105-1 assume !(0 != main_~p5~0); 4920#L110-1 assume !(0 != main_~p6~0); 4917#L115-1 assume !(0 != main_~p7~0); 4915#L120-1 assume !(0 != main_~p8~0); 4564#L125-1 [2018-11-23 01:39:58,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:39:58,777 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2018-11-23 01:39:58,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:39:58,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:39:58,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:39:58,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:39:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:39:58,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:39:58,781 INFO L82 PathProgramCache]: Analyzing trace with hash -765191736, now seen corresponding path program 1 times [2018-11-23 01:39:58,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:39:58,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:39:58,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:39:58,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:39:58,800 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-23 01:39:58,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:39:58,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 01:39:58,800 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 01:39:58,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:39:58,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:39:58,801 INFO L87 Difference]: Start difference. First operand 1473 states and 2113 transitions. cyclomatic complexity: 704 Second operand 3 states. [2018-11-23 01:39:58,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:39:58,831 INFO L93 Difference]: Finished difference Result 2881 states and 4033 transitions. [2018-11-23 01:39:58,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:39:58,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2881 states and 4033 transitions. [2018-11-23 01:39:58,846 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2018-11-23 01:39:58,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2881 states to 2881 states and 4033 transitions. [2018-11-23 01:39:58,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2881 [2018-11-23 01:39:58,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2881 [2018-11-23 01:39:58,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2881 states and 4033 transitions. [2018-11-23 01:39:58,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 01:39:58,866 INFO L705 BuchiCegarLoop]: Abstraction has 2881 states and 4033 transitions. [2018-11-23 01:39:58,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states and 4033 transitions. [2018-11-23 01:39:58,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 2881. [2018-11-23 01:39:58,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2881 states. [2018-11-23 01:39:58,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2881 states and 4033 transitions. [2018-11-23 01:39:58,911 INFO L728 BuchiCegarLoop]: Abstraction has 2881 states and 4033 transitions. [2018-11-23 01:39:58,911 INFO L608 BuchiCegarLoop]: Abstraction has 2881 states and 4033 transitions. [2018-11-23 01:39:58,912 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 01:39:58,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2881 states and 4033 transitions. [2018-11-23 01:39:58,923 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2018-11-23 01:39:58,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 01:39:58,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 01:39:58,924 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 01:39:58,924 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:39:58,924 INFO L794 eck$LassoCheckResult]: Stem: 8923#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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~0;havoc main_~cond~0; 8924#L125-1 [2018-11-23 01:39:58,924 INFO L796 eck$LassoCheckResult]: Loop: 8924#L125-1 assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; 9159#L35 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;main_~lk7~0 := 0;main_~lk8~0 := 0; 9153#L56 assume !(0 != main_~p1~0); 9149#L56-2 assume !(0 != main_~p2~0); 9148#L60-1 assume !(0 != main_~p3~0); 9145#L64-1 assume !(0 != main_~p4~0); 9144#L68-1 assume !(0 != main_~p5~0); 8965#L72-1 assume !(0 != main_~p6~0); 8966#L76-1 assume !(0 != main_~p7~0); 9113#L80-1 assume !(0 != main_~p8~0); 9109#L84-1 assume !(0 != main_~p1~0); 9084#L90-1 assume !(0 != main_~p2~0); 9082#L95-1 assume !(0 != main_~p3~0); 9077#L100-1 assume !(0 != main_~p4~0); 9074#L105-1 assume !(0 != main_~p5~0); 9070#L110-1 assume !(0 != main_~p6~0); 9034#L115-1 assume !(0 != main_~p7~0); 9036#L120-1 assume !(0 != main_~p8~0); 8924#L125-1 [2018-11-23 01:39:58,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:39:58,925 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2018-11-23 01:39:58,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:39:58,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:39:58,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:39:58,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:39:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:39:58,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:39:58,928 INFO L82 PathProgramCache]: Analyzing trace with hash -85133366, now seen corresponding path program 1 times [2018-11-23 01:39:58,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:39:58,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:39:58,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 01:39:58,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:39:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:39:58,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:39:58,939 INFO L82 PathProgramCache]: Analyzing trace with hash -493957591, now seen corresponding path program 1 times [2018-11-23 01:39:58,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:39:58,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:39:58,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:39:58,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:39:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:39:58,946 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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L31] 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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L31] 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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L31] 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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L31] 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; [L24] ~p7~0 := #t~nondet6; [L24] havoc #t~nondet6; [L25] havoc ~lk7~0; [L27] ~p8~0 := #t~nondet7; [L27] havoc #t~nondet7; [L28] havoc ~lk8~0; [L31] 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; [L24] ~p7~0 := #t~nondet6; [L24] havoc #t~nondet6; [L25] havoc ~lk7~0; [L27] ~p8~0 := #t~nondet7; [L27] havoc #t~nondet7; [L28] havoc ~lk8~0; [L31] 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; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L31] int cond; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; [?] 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;main_~lk7~0 := 0;main_~lk8~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_~p7~0); [?] assume !(0 != main_~p8~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_~p7~0); [?] assume !(0 != main_~p8~0); [L33-L130] assume !false; [L34] main_~cond~0 := main_#t~nondet8; [L34] havoc main_#t~nondet8; [L35-L37] assume !(0 == main_~cond~0); [L38] main_~lk1~0 := 0; [L40] main_~lk2~0 := 0; [L42] main_~lk3~0 := 0; [L44] main_~lk4~0 := 0; [L46] main_~lk5~0 := 0; [L48] main_~lk6~0 := 0; [L50] main_~lk7~0 := 0; [L52] main_~lk8~0 := 0; [L56-L58] assume !(0 != main_~p1~0); [L60-L62] assume !(0 != main_~p2~0); [L64-L66] assume !(0 != main_~p3~0); [L68-L70] assume !(0 != main_~p4~0); [L72-L74] assume !(0 != main_~p5~0); [L76-L78] assume !(0 != main_~p6~0); [L80-L82] assume !(0 != main_~p7~0); [L84-L86] assume !(0 != main_~p8~0); [L90-L93] assume !(0 != main_~p1~0); [L95-L98] assume !(0 != main_~p2~0); [L100-L103] assume !(0 != main_~p3~0); [L105-L108] assume !(0 != main_~p4~0); [L110-L113] assume !(0 != main_~p5~0); [L115-L118] assume !(0 != main_~p6~0); [L120-L123] assume !(0 != main_~p7~0); [L125-L128] assume !(0 != main_~p8~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L33-L130] assume !false; [L34] main_~cond~0 := main_#t~nondet8; [L34] havoc main_#t~nondet8; [L35-L37] assume !(0 == main_~cond~0); [L38] main_~lk1~0 := 0; [L40] main_~lk2~0 := 0; [L42] main_~lk3~0 := 0; [L44] main_~lk4~0 := 0; [L46] main_~lk5~0 := 0; [L48] main_~lk6~0 := 0; [L50] main_~lk7~0 := 0; [L52] main_~lk8~0 := 0; [L56-L58] assume !(0 != main_~p1~0); [L60-L62] assume !(0 != main_~p2~0); [L64-L66] assume !(0 != main_~p3~0); [L68-L70] assume !(0 != main_~p4~0); [L72-L74] assume !(0 != main_~p5~0); [L76-L78] assume !(0 != main_~p6~0); [L80-L82] assume !(0 != main_~p7~0); [L84-L86] assume !(0 != main_~p8~0); [L90-L93] assume !(0 != main_~p1~0); [L95-L98] assume !(0 != main_~p2~0); [L100-L103] assume !(0 != main_~p3~0); [L105-L108] assume !(0 != main_~p4~0); [L110-L113] assume !(0 != main_~p5~0); [L115-L118] assume !(0 != main_~p6~0); [L120-L123] assume !(0 != main_~p7~0); [L125-L128] assume !(0 != main_~p8~0); [L33-L130] COND FALSE !(false) [L34] main_~cond~0 := main_#t~nondet8; [L34] havoc main_#t~nondet8; [L35] COND FALSE !(0 == main_~cond~0) [L38] main_~lk1~0 := 0; [L40] main_~lk2~0 := 0; [L42] main_~lk3~0 := 0; [L44] main_~lk4~0 := 0; [L46] main_~lk5~0 := 0; [L48] main_~lk6~0 := 0; [L50] main_~lk7~0 := 0; [L52] main_~lk8~0 := 0; [L56] COND FALSE !(0 != main_~p1~0) [L60] COND FALSE !(0 != main_~p2~0) [L64] COND FALSE !(0 != main_~p3~0) [L68] COND FALSE !(0 != main_~p4~0) [L72] COND FALSE !(0 != main_~p5~0) [L76] COND FALSE !(0 != main_~p6~0) [L80] COND FALSE !(0 != main_~p7~0) [L84] COND FALSE !(0 != main_~p8~0) [L90] COND FALSE !(0 != main_~p1~0) [L95] COND FALSE !(0 != main_~p2~0) [L100] COND FALSE !(0 != main_~p3~0) [L105] COND FALSE !(0 != main_~p4~0) [L110] COND FALSE !(0 != main_~p5~0) [L115] COND FALSE !(0 != main_~p6~0) [L120] COND FALSE !(0 != main_~p7~0) [L125] COND FALSE !(0 != main_~p8~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L33-L130] COND FALSE !(false) [L34] main_~cond~0 := main_#t~nondet8; [L34] havoc main_#t~nondet8; [L35] COND FALSE !(0 == main_~cond~0) [L38] main_~lk1~0 := 0; [L40] main_~lk2~0 := 0; [L42] main_~lk3~0 := 0; [L44] main_~lk4~0 := 0; [L46] main_~lk5~0 := 0; [L48] main_~lk6~0 := 0; [L50] main_~lk7~0 := 0; [L52] main_~lk8~0 := 0; [L56] COND FALSE !(0 != main_~p1~0) [L60] COND FALSE !(0 != main_~p2~0) [L64] COND FALSE !(0 != main_~p3~0) [L68] COND FALSE !(0 != main_~p4~0) [L72] COND FALSE !(0 != main_~p5~0) [L76] COND FALSE !(0 != main_~p6~0) [L80] COND FALSE !(0 != main_~p7~0) [L84] COND FALSE !(0 != main_~p8~0) [L90] COND FALSE !(0 != main_~p1~0) [L95] COND FALSE !(0 != main_~p2~0) [L100] COND FALSE !(0 != main_~p3~0) [L105] COND FALSE !(0 != main_~p4~0) [L110] COND FALSE !(0 != main_~p5~0) [L115] COND FALSE !(0 != main_~p6~0) [L120] COND FALSE !(0 != main_~p7~0) [L125] COND FALSE !(0 != main_~p8~0) [L33-L130] COND FALSE !(false) [L34] ~cond~0 := #t~nondet8; [L34] havoc #t~nondet8; [L35] COND FALSE !(0 == ~cond~0) [L38] ~lk1~0 := 0; [L40] ~lk2~0 := 0; [L42] ~lk3~0 := 0; [L44] ~lk4~0 := 0; [L46] ~lk5~0 := 0; [L48] ~lk6~0 := 0; [L50] ~lk7~0 := 0; [L52] ~lk8~0 := 0; [L56] COND FALSE !(0 != ~p1~0) [L60] COND FALSE !(0 != ~p2~0) [L64] COND FALSE !(0 != ~p3~0) [L68] COND FALSE !(0 != ~p4~0) [L72] COND FALSE !(0 != ~p5~0) [L76] COND FALSE !(0 != ~p6~0) [L80] COND FALSE !(0 != ~p7~0) [L84] COND FALSE !(0 != ~p8~0) [L90] COND FALSE !(0 != ~p1~0) [L95] COND FALSE !(0 != ~p2~0) [L100] COND FALSE !(0 != ~p3~0) [L105] COND FALSE !(0 != ~p4~0) [L110] COND FALSE !(0 != ~p5~0) [L115] COND FALSE !(0 != ~p6~0) [L120] COND FALSE !(0 != ~p7~0) [L125] COND FALSE !(0 != ~p8~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L33-L130] COND FALSE !(false) [L34] ~cond~0 := #t~nondet8; [L34] havoc #t~nondet8; [L35] COND FALSE !(0 == ~cond~0) [L38] ~lk1~0 := 0; [L40] ~lk2~0 := 0; [L42] ~lk3~0 := 0; [L44] ~lk4~0 := 0; [L46] ~lk5~0 := 0; [L48] ~lk6~0 := 0; [L50] ~lk7~0 := 0; [L52] ~lk8~0 := 0; [L56] COND FALSE !(0 != ~p1~0) [L60] COND FALSE !(0 != ~p2~0) [L64] COND FALSE !(0 != ~p3~0) [L68] COND FALSE !(0 != ~p4~0) [L72] COND FALSE !(0 != ~p5~0) [L76] COND FALSE !(0 != ~p6~0) [L80] COND FALSE !(0 != ~p7~0) [L84] COND FALSE !(0 != ~p8~0) [L90] COND FALSE !(0 != ~p1~0) [L95] COND FALSE !(0 != ~p2~0) [L100] COND FALSE !(0 != ~p3~0) [L105] COND FALSE !(0 != ~p4~0) [L110] COND FALSE !(0 != ~p5~0) [L115] COND FALSE !(0 != ~p6~0) [L120] COND FALSE !(0 != ~p7~0) [L125] COND FALSE !(0 != ~p8~0) [L33] COND TRUE 1 [L34] cond = __VERIFIER_nondet_int() [L35] COND FALSE !(cond == 0) [L38] lk1 = 0 [L40] lk2 = 0 [L42] lk3 = 0 [L44] lk4 = 0 [L46] lk5 = 0 [L48] lk6 = 0 [L50] lk7 = 0 [L52] lk8 = 0 [L56] COND FALSE !(p1 != 0) [L60] COND FALSE !(p2 != 0) [L64] COND FALSE !(p3 != 0) [L68] COND FALSE !(p4 != 0) [L72] COND FALSE !(p5 != 0) [L76] COND FALSE !(p6 != 0) [L80] COND FALSE !(p7 != 0) [L84] COND FALSE !(p8 != 0) [L90] COND FALSE !(p1 != 0) [L95] COND FALSE !(p2 != 0) [L100] COND FALSE !(p3 != 0) [L105] COND FALSE !(p4 != 0) [L110] COND FALSE !(p5 != 0) [L115] COND FALSE !(p6 != 0) [L120] COND FALSE !(p7 != 0) [L125] COND FALSE !(p8 != 0) ----- [2018-11-23 01:39:59,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 01:39:59 BoogieIcfgContainer [2018-11-23 01:39:59,120 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 01:39:59,120 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:39:59,120 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:39:59,120 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:39:59,121 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:39:58" (3/4) ... [2018-11-23 01:39:59,124 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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L31] 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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L31] 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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L31] 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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L31] 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; [L24] ~p7~0 := #t~nondet6; [L24] havoc #t~nondet6; [L25] havoc ~lk7~0; [L27] ~p8~0 := #t~nondet7; [L27] havoc #t~nondet7; [L28] havoc ~lk8~0; [L31] 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; [L24] ~p7~0 := #t~nondet6; [L24] havoc #t~nondet6; [L25] havoc ~lk7~0; [L27] ~p8~0 := #t~nondet7; [L27] havoc #t~nondet7; [L28] havoc ~lk8~0; [L31] 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; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L31] int cond; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; [?] 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;main_~lk7~0 := 0;main_~lk8~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_~p7~0); [?] assume !(0 != main_~p8~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_~p7~0); [?] assume !(0 != main_~p8~0); [L33-L130] assume !false; [L34] main_~cond~0 := main_#t~nondet8; [L34] havoc main_#t~nondet8; [L35-L37] assume !(0 == main_~cond~0); [L38] main_~lk1~0 := 0; [L40] main_~lk2~0 := 0; [L42] main_~lk3~0 := 0; [L44] main_~lk4~0 := 0; [L46] main_~lk5~0 := 0; [L48] main_~lk6~0 := 0; [L50] main_~lk7~0 := 0; [L52] main_~lk8~0 := 0; [L56-L58] assume !(0 != main_~p1~0); [L60-L62] assume !(0 != main_~p2~0); [L64-L66] assume !(0 != main_~p3~0); [L68-L70] assume !(0 != main_~p4~0); [L72-L74] assume !(0 != main_~p5~0); [L76-L78] assume !(0 != main_~p6~0); [L80-L82] assume !(0 != main_~p7~0); [L84-L86] assume !(0 != main_~p8~0); [L90-L93] assume !(0 != main_~p1~0); [L95-L98] assume !(0 != main_~p2~0); [L100-L103] assume !(0 != main_~p3~0); [L105-L108] assume !(0 != main_~p4~0); [L110-L113] assume !(0 != main_~p5~0); [L115-L118] assume !(0 != main_~p6~0); [L120-L123] assume !(0 != main_~p7~0); [L125-L128] assume !(0 != main_~p8~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L33-L130] assume !false; [L34] main_~cond~0 := main_#t~nondet8; [L34] havoc main_#t~nondet8; [L35-L37] assume !(0 == main_~cond~0); [L38] main_~lk1~0 := 0; [L40] main_~lk2~0 := 0; [L42] main_~lk3~0 := 0; [L44] main_~lk4~0 := 0; [L46] main_~lk5~0 := 0; [L48] main_~lk6~0 := 0; [L50] main_~lk7~0 := 0; [L52] main_~lk8~0 := 0; [L56-L58] assume !(0 != main_~p1~0); [L60-L62] assume !(0 != main_~p2~0); [L64-L66] assume !(0 != main_~p3~0); [L68-L70] assume !(0 != main_~p4~0); [L72-L74] assume !(0 != main_~p5~0); [L76-L78] assume !(0 != main_~p6~0); [L80-L82] assume !(0 != main_~p7~0); [L84-L86] assume !(0 != main_~p8~0); [L90-L93] assume !(0 != main_~p1~0); [L95-L98] assume !(0 != main_~p2~0); [L100-L103] assume !(0 != main_~p3~0); [L105-L108] assume !(0 != main_~p4~0); [L110-L113] assume !(0 != main_~p5~0); [L115-L118] assume !(0 != main_~p6~0); [L120-L123] assume !(0 != main_~p7~0); [L125-L128] assume !(0 != main_~p8~0); [L33-L130] COND FALSE !(false) [L34] main_~cond~0 := main_#t~nondet8; [L34] havoc main_#t~nondet8; [L35] COND FALSE !(0 == main_~cond~0) [L38] main_~lk1~0 := 0; [L40] main_~lk2~0 := 0; [L42] main_~lk3~0 := 0; [L44] main_~lk4~0 := 0; [L46] main_~lk5~0 := 0; [L48] main_~lk6~0 := 0; [L50] main_~lk7~0 := 0; [L52] main_~lk8~0 := 0; [L56] COND FALSE !(0 != main_~p1~0) [L60] COND FALSE !(0 != main_~p2~0) [L64] COND FALSE !(0 != main_~p3~0) [L68] COND FALSE !(0 != main_~p4~0) [L72] COND FALSE !(0 != main_~p5~0) [L76] COND FALSE !(0 != main_~p6~0) [L80] COND FALSE !(0 != main_~p7~0) [L84] COND FALSE !(0 != main_~p8~0) [L90] COND FALSE !(0 != main_~p1~0) [L95] COND FALSE !(0 != main_~p2~0) [L100] COND FALSE !(0 != main_~p3~0) [L105] COND FALSE !(0 != main_~p4~0) [L110] COND FALSE !(0 != main_~p5~0) [L115] COND FALSE !(0 != main_~p6~0) [L120] COND FALSE !(0 != main_~p7~0) [L125] COND FALSE !(0 != main_~p8~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L33-L130] COND FALSE !(false) [L34] main_~cond~0 := main_#t~nondet8; [L34] havoc main_#t~nondet8; [L35] COND FALSE !(0 == main_~cond~0) [L38] main_~lk1~0 := 0; [L40] main_~lk2~0 := 0; [L42] main_~lk3~0 := 0; [L44] main_~lk4~0 := 0; [L46] main_~lk5~0 := 0; [L48] main_~lk6~0 := 0; [L50] main_~lk7~0 := 0; [L52] main_~lk8~0 := 0; [L56] COND FALSE !(0 != main_~p1~0) [L60] COND FALSE !(0 != main_~p2~0) [L64] COND FALSE !(0 != main_~p3~0) [L68] COND FALSE !(0 != main_~p4~0) [L72] COND FALSE !(0 != main_~p5~0) [L76] COND FALSE !(0 != main_~p6~0) [L80] COND FALSE !(0 != main_~p7~0) [L84] COND FALSE !(0 != main_~p8~0) [L90] COND FALSE !(0 != main_~p1~0) [L95] COND FALSE !(0 != main_~p2~0) [L100] COND FALSE !(0 != main_~p3~0) [L105] COND FALSE !(0 != main_~p4~0) [L110] COND FALSE !(0 != main_~p5~0) [L115] COND FALSE !(0 != main_~p6~0) [L120] COND FALSE !(0 != main_~p7~0) [L125] COND FALSE !(0 != main_~p8~0) [L33-L130] COND FALSE !(false) [L34] ~cond~0 := #t~nondet8; [L34] havoc #t~nondet8; [L35] COND FALSE !(0 == ~cond~0) [L38] ~lk1~0 := 0; [L40] ~lk2~0 := 0; [L42] ~lk3~0 := 0; [L44] ~lk4~0 := 0; [L46] ~lk5~0 := 0; [L48] ~lk6~0 := 0; [L50] ~lk7~0 := 0; [L52] ~lk8~0 := 0; [L56] COND FALSE !(0 != ~p1~0) [L60] COND FALSE !(0 != ~p2~0) [L64] COND FALSE !(0 != ~p3~0) [L68] COND FALSE !(0 != ~p4~0) [L72] COND FALSE !(0 != ~p5~0) [L76] COND FALSE !(0 != ~p6~0) [L80] COND FALSE !(0 != ~p7~0) [L84] COND FALSE !(0 != ~p8~0) [L90] COND FALSE !(0 != ~p1~0) [L95] COND FALSE !(0 != ~p2~0) [L100] COND FALSE !(0 != ~p3~0) [L105] COND FALSE !(0 != ~p4~0) [L110] COND FALSE !(0 != ~p5~0) [L115] COND FALSE !(0 != ~p6~0) [L120] COND FALSE !(0 != ~p7~0) [L125] COND FALSE !(0 != ~p8~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L33-L130] COND FALSE !(false) [L34] ~cond~0 := #t~nondet8; [L34] havoc #t~nondet8; [L35] COND FALSE !(0 == ~cond~0) [L38] ~lk1~0 := 0; [L40] ~lk2~0 := 0; [L42] ~lk3~0 := 0; [L44] ~lk4~0 := 0; [L46] ~lk5~0 := 0; [L48] ~lk6~0 := 0; [L50] ~lk7~0 := 0; [L52] ~lk8~0 := 0; [L56] COND FALSE !(0 != ~p1~0) [L60] COND FALSE !(0 != ~p2~0) [L64] COND FALSE !(0 != ~p3~0) [L68] COND FALSE !(0 != ~p4~0) [L72] COND FALSE !(0 != ~p5~0) [L76] COND FALSE !(0 != ~p6~0) [L80] COND FALSE !(0 != ~p7~0) [L84] COND FALSE !(0 != ~p8~0) [L90] COND FALSE !(0 != ~p1~0) [L95] COND FALSE !(0 != ~p2~0) [L100] COND FALSE !(0 != ~p3~0) [L105] COND FALSE !(0 != ~p4~0) [L110] COND FALSE !(0 != ~p5~0) [L115] COND FALSE !(0 != ~p6~0) [L120] COND FALSE !(0 != ~p7~0) [L125] COND FALSE !(0 != ~p8~0) [L33] COND TRUE 1 [L34] cond = __VERIFIER_nondet_int() [L35] COND FALSE !(cond == 0) [L38] lk1 = 0 [L40] lk2 = 0 [L42] lk3 = 0 [L44] lk4 = 0 [L46] lk5 = 0 [L48] lk6 = 0 [L50] lk7 = 0 [L52] lk8 = 0 [L56] COND FALSE !(p1 != 0) [L60] COND FALSE !(p2 != 0) [L64] COND FALSE !(p3 != 0) [L68] COND FALSE !(p4 != 0) [L72] COND FALSE !(p5 != 0) [L76] COND FALSE !(p6 != 0) [L80] COND FALSE !(p7 != 0) [L84] COND FALSE !(p8 != 0) [L90] COND FALSE !(p1 != 0) [L95] COND FALSE !(p2 != 0) [L100] COND FALSE !(p3 != 0) [L105] COND FALSE !(p4 != 0) [L110] COND FALSE !(p5 != 0) [L115] COND FALSE !(p6 != 0) [L120] COND FALSE !(p7 != 0) [L125] COND FALSE !(p8 != 0) ----- [2018-11-23 01:39:59,171 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c659a199-702f-4e74-af5d-e720e1cfe0f9/bin-2019/uautomizer/witness.graphml [2018-11-23 01:39:59,171 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:39:59,172 INFO L168 Benchmark]: Toolchain (without parser) took 1573.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 958.2 MB in the beginning and 974.7 MB in the end (delta: -16.5 MB). Peak memory consumption was 139.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:39:59,173 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:39:59,173 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.71 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:39:59,174 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.64 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:39:59,174 INFO L168 Benchmark]: Boogie Preprocessor took 48.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 944.8 MB in the beginning and 1.2 GB in the end (delta: -209.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:39:59,174 INFO L168 Benchmark]: RCFGBuilder took 181.19 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: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2018-11-23 01:39:59,175 INFO L168 Benchmark]: BuchiAutomizer took 1066.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 978.1 MB in the end (delta: 155.0 MB). Peak memory consumption was 155.0 MB. Max. memory is 11.5 GB. [2018-11-23 01:39:59,175 INFO L168 Benchmark]: Witness Printer took 50.92 ms. Allocated memory is still 1.2 GB. Free memory was 978.1 MB in the beginning and 974.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 01:39:59,177 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 201.71 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 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 21.64 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 944.8 MB in the beginning and 1.2 GB in the end (delta: -209.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 181.19 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: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1066.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 978.1 MB in the end (delta: 155.0 MB). Peak memory consumption was 155.0 MB. Max. memory is 11.5 GB. * Witness Printer took 50.92 ms. Allocated memory is still 1.2 GB. Free memory was 978.1 MB in the beginning and 974.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 2881 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.0s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 0.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 2881 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 452 SDtfs, 236 SDslu, 270 SDs, 0 SdLazy, 35 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI7 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: 33]: 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, p7=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6435238a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1cf9ecb0=1, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@24bbc1b2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2d4abfdb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1ce67f6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1ef9d7b6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@72ef72ec=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1347fdf1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@472b1061=0, cond=1, lk3=0, lk4=0, lk5=0, lk6=0, lk1=0, lk2=0, lk7=0, lk8=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 33]: 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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L31] 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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L31] 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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L31] 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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L31] 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; [L24] ~p7~0 := #t~nondet6; [L24] havoc #t~nondet6; [L25] havoc ~lk7~0; [L27] ~p8~0 := #t~nondet7; [L27] havoc #t~nondet7; [L28] havoc ~lk8~0; [L31] 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; [L24] ~p7~0 := #t~nondet6; [L24] havoc #t~nondet6; [L25] havoc ~lk7~0; [L27] ~p8~0 := #t~nondet7; [L27] havoc #t~nondet7; [L28] havoc ~lk8~0; [L31] 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; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L31] int cond; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; [?] 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;main_~lk7~0 := 0;main_~lk8~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_~p7~0); [?] assume !(0 != main_~p8~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_~p7~0); [?] assume !(0 != main_~p8~0); [L33-L130] assume !false; [L34] main_~cond~0 := main_#t~nondet8; [L34] havoc main_#t~nondet8; [L35-L37] assume !(0 == main_~cond~0); [L38] main_~lk1~0 := 0; [L40] main_~lk2~0 := 0; [L42] main_~lk3~0 := 0; [L44] main_~lk4~0 := 0; [L46] main_~lk5~0 := 0; [L48] main_~lk6~0 := 0; [L50] main_~lk7~0 := 0; [L52] main_~lk8~0 := 0; [L56-L58] assume !(0 != main_~p1~0); [L60-L62] assume !(0 != main_~p2~0); [L64-L66] assume !(0 != main_~p3~0); [L68-L70] assume !(0 != main_~p4~0); [L72-L74] assume !(0 != main_~p5~0); [L76-L78] assume !(0 != main_~p6~0); [L80-L82] assume !(0 != main_~p7~0); [L84-L86] assume !(0 != main_~p8~0); [L90-L93] assume !(0 != main_~p1~0); [L95-L98] assume !(0 != main_~p2~0); [L100-L103] assume !(0 != main_~p3~0); [L105-L108] assume !(0 != main_~p4~0); [L110-L113] assume !(0 != main_~p5~0); [L115-L118] assume !(0 != main_~p6~0); [L120-L123] assume !(0 != main_~p7~0); [L125-L128] assume !(0 != main_~p8~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L33-L130] assume !false; [L34] main_~cond~0 := main_#t~nondet8; [L34] havoc main_#t~nondet8; [L35-L37] assume !(0 == main_~cond~0); [L38] main_~lk1~0 := 0; [L40] main_~lk2~0 := 0; [L42] main_~lk3~0 := 0; [L44] main_~lk4~0 := 0; [L46] main_~lk5~0 := 0; [L48] main_~lk6~0 := 0; [L50] main_~lk7~0 := 0; [L52] main_~lk8~0 := 0; [L56-L58] assume !(0 != main_~p1~0); [L60-L62] assume !(0 != main_~p2~0); [L64-L66] assume !(0 != main_~p3~0); [L68-L70] assume !(0 != main_~p4~0); [L72-L74] assume !(0 != main_~p5~0); [L76-L78] assume !(0 != main_~p6~0); [L80-L82] assume !(0 != main_~p7~0); [L84-L86] assume !(0 != main_~p8~0); [L90-L93] assume !(0 != main_~p1~0); [L95-L98] assume !(0 != main_~p2~0); [L100-L103] assume !(0 != main_~p3~0); [L105-L108] assume !(0 != main_~p4~0); [L110-L113] assume !(0 != main_~p5~0); [L115-L118] assume !(0 != main_~p6~0); [L120-L123] assume !(0 != main_~p7~0); [L125-L128] assume !(0 != main_~p8~0); [L33-L130] COND FALSE !(false) [L34] main_~cond~0 := main_#t~nondet8; [L34] havoc main_#t~nondet8; [L35] COND FALSE !(0 == main_~cond~0) [L38] main_~lk1~0 := 0; [L40] main_~lk2~0 := 0; [L42] main_~lk3~0 := 0; [L44] main_~lk4~0 := 0; [L46] main_~lk5~0 := 0; [L48] main_~lk6~0 := 0; [L50] main_~lk7~0 := 0; [L52] main_~lk8~0 := 0; [L56] COND FALSE !(0 != main_~p1~0) [L60] COND FALSE !(0 != main_~p2~0) [L64] COND FALSE !(0 != main_~p3~0) [L68] COND FALSE !(0 != main_~p4~0) [L72] COND FALSE !(0 != main_~p5~0) [L76] COND FALSE !(0 != main_~p6~0) [L80] COND FALSE !(0 != main_~p7~0) [L84] COND FALSE !(0 != main_~p8~0) [L90] COND FALSE !(0 != main_~p1~0) [L95] COND FALSE !(0 != main_~p2~0) [L100] COND FALSE !(0 != main_~p3~0) [L105] COND FALSE !(0 != main_~p4~0) [L110] COND FALSE !(0 != main_~p5~0) [L115] COND FALSE !(0 != main_~p6~0) [L120] COND FALSE !(0 != main_~p7~0) [L125] COND FALSE !(0 != main_~p8~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L33-L130] COND FALSE !(false) [L34] main_~cond~0 := main_#t~nondet8; [L34] havoc main_#t~nondet8; [L35] COND FALSE !(0 == main_~cond~0) [L38] main_~lk1~0 := 0; [L40] main_~lk2~0 := 0; [L42] main_~lk3~0 := 0; [L44] main_~lk4~0 := 0; [L46] main_~lk5~0 := 0; [L48] main_~lk6~0 := 0; [L50] main_~lk7~0 := 0; [L52] main_~lk8~0 := 0; [L56] COND FALSE !(0 != main_~p1~0) [L60] COND FALSE !(0 != main_~p2~0) [L64] COND FALSE !(0 != main_~p3~0) [L68] COND FALSE !(0 != main_~p4~0) [L72] COND FALSE !(0 != main_~p5~0) [L76] COND FALSE !(0 != main_~p6~0) [L80] COND FALSE !(0 != main_~p7~0) [L84] COND FALSE !(0 != main_~p8~0) [L90] COND FALSE !(0 != main_~p1~0) [L95] COND FALSE !(0 != main_~p2~0) [L100] COND FALSE !(0 != main_~p3~0) [L105] COND FALSE !(0 != main_~p4~0) [L110] COND FALSE !(0 != main_~p5~0) [L115] COND FALSE !(0 != main_~p6~0) [L120] COND FALSE !(0 != main_~p7~0) [L125] COND FALSE !(0 != main_~p8~0) [L33-L130] COND FALSE !(false) [L34] ~cond~0 := #t~nondet8; [L34] havoc #t~nondet8; [L35] COND FALSE !(0 == ~cond~0) [L38] ~lk1~0 := 0; [L40] ~lk2~0 := 0; [L42] ~lk3~0 := 0; [L44] ~lk4~0 := 0; [L46] ~lk5~0 := 0; [L48] ~lk6~0 := 0; [L50] ~lk7~0 := 0; [L52] ~lk8~0 := 0; [L56] COND FALSE !(0 != ~p1~0) [L60] COND FALSE !(0 != ~p2~0) [L64] COND FALSE !(0 != ~p3~0) [L68] COND FALSE !(0 != ~p4~0) [L72] COND FALSE !(0 != ~p5~0) [L76] COND FALSE !(0 != ~p6~0) [L80] COND FALSE !(0 != ~p7~0) [L84] COND FALSE !(0 != ~p8~0) [L90] COND FALSE !(0 != ~p1~0) [L95] COND FALSE !(0 != ~p2~0) [L100] COND FALSE !(0 != ~p3~0) [L105] COND FALSE !(0 != ~p4~0) [L110] COND FALSE !(0 != ~p5~0) [L115] COND FALSE !(0 != ~p6~0) [L120] COND FALSE !(0 != ~p7~0) [L125] COND FALSE !(0 != ~p8~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L33-L130] COND FALSE !(false) [L34] ~cond~0 := #t~nondet8; [L34] havoc #t~nondet8; [L35] COND FALSE !(0 == ~cond~0) [L38] ~lk1~0 := 0; [L40] ~lk2~0 := 0; [L42] ~lk3~0 := 0; [L44] ~lk4~0 := 0; [L46] ~lk5~0 := 0; [L48] ~lk6~0 := 0; [L50] ~lk7~0 := 0; [L52] ~lk8~0 := 0; [L56] COND FALSE !(0 != ~p1~0) [L60] COND FALSE !(0 != ~p2~0) [L64] COND FALSE !(0 != ~p3~0) [L68] COND FALSE !(0 != ~p4~0) [L72] COND FALSE !(0 != ~p5~0) [L76] COND FALSE !(0 != ~p6~0) [L80] COND FALSE !(0 != ~p7~0) [L84] COND FALSE !(0 != ~p8~0) [L90] COND FALSE !(0 != ~p1~0) [L95] COND FALSE !(0 != ~p2~0) [L100] COND FALSE !(0 != ~p3~0) [L105] COND FALSE !(0 != ~p4~0) [L110] COND FALSE !(0 != ~p5~0) [L115] COND FALSE !(0 != ~p6~0) [L120] COND FALSE !(0 != ~p7~0) [L125] COND FALSE !(0 != ~p8~0) [L33] COND TRUE 1 [L34] cond = __VERIFIER_nondet_int() [L35] COND FALSE !(cond == 0) [L38] lk1 = 0 [L40] lk2 = 0 [L42] lk3 = 0 [L44] lk4 = 0 [L46] lk5 = 0 [L48] lk6 = 0 [L50] lk7 = 0 [L52] lk8 = 0 [L56] COND FALSE !(p1 != 0) [L60] COND FALSE !(p2 != 0) [L64] COND FALSE !(p3 != 0) [L68] COND FALSE !(p4 != 0) [L72] COND FALSE !(p5 != 0) [L76] COND FALSE !(p6 != 0) [L80] COND FALSE !(p7 != 0) [L84] COND FALSE !(p8 != 0) [L90] COND FALSE !(p1 != 0) [L95] COND FALSE !(p2 != 0) [L100] COND FALSE !(p3 != 0) [L105] COND FALSE !(p4 != 0) [L110] COND FALSE !(p5 != 0) [L115] COND FALSE !(p6 != 0) [L120] COND FALSE !(p7 != 0) [L125] COND FALSE !(p8 != 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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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;main_~p7~0 := main_#t~nondet6;havoc main_#t~nondet6;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk8~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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L31] 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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L31] 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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L31] 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_#t~nondet7, main_#t~nondet8, 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_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~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; [L24] main_~p7~0 := main_#t~nondet6; [L24] havoc main_#t~nondet6; [L25] havoc main_~lk7~0; [L27] main_~p8~0 := main_#t~nondet7; [L27] havoc main_#t~nondet7; [L28] havoc main_~lk8~0; [L31] 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; [L24] ~p7~0 := #t~nondet6; [L24] havoc #t~nondet6; [L25] havoc ~lk7~0; [L27] ~p8~0 := #t~nondet7; [L27] havoc #t~nondet7; [L28] havoc ~lk8~0; [L31] 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; [L24] ~p7~0 := #t~nondet6; [L24] havoc #t~nondet6; [L25] havoc ~lk7~0; [L27] ~p8~0 := #t~nondet7; [L27] havoc #t~nondet7; [L28] havoc ~lk8~0; [L31] 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; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L31] int cond; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false;main_~cond~0 := main_#t~nondet8;havoc main_#t~nondet8; [?] 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;main_~lk7~0 := 0;main_~lk8~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_~p7~0); [?] assume !(0 != main_~p8~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_~p7~0); [?] assume !(0 != main_~p8~0); [L33-L130] assume !false; [L34] main_~cond~0 := main_#t~nondet8; [L34] havoc main_#t~nondet8; [L35-L37] assume !(0 == main_~cond~0); [L38] main_~lk1~0 := 0; [L40] main_~lk2~0 := 0; [L42] main_~lk3~0 := 0; [L44] main_~lk4~0 := 0; [L46] main_~lk5~0 := 0; [L48] main_~lk6~0 := 0; [L50] main_~lk7~0 := 0; [L52] main_~lk8~0 := 0; [L56-L58] assume !(0 != main_~p1~0); [L60-L62] assume !(0 != main_~p2~0); [L64-L66] assume !(0 != main_~p3~0); [L68-L70] assume !(0 != main_~p4~0); [L72-L74] assume !(0 != main_~p5~0); [L76-L78] assume !(0 != main_~p6~0); [L80-L82] assume !(0 != main_~p7~0); [L84-L86] assume !(0 != main_~p8~0); [L90-L93] assume !(0 != main_~p1~0); [L95-L98] assume !(0 != main_~p2~0); [L100-L103] assume !(0 != main_~p3~0); [L105-L108] assume !(0 != main_~p4~0); [L110-L113] assume !(0 != main_~p5~0); [L115-L118] assume !(0 != main_~p6~0); [L120-L123] assume !(0 != main_~p7~0); [L125-L128] assume !(0 != main_~p8~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L33-L130] assume !false; [L34] main_~cond~0 := main_#t~nondet8; [L34] havoc main_#t~nondet8; [L35-L37] assume !(0 == main_~cond~0); [L38] main_~lk1~0 := 0; [L40] main_~lk2~0 := 0; [L42] main_~lk3~0 := 0; [L44] main_~lk4~0 := 0; [L46] main_~lk5~0 := 0; [L48] main_~lk6~0 := 0; [L50] main_~lk7~0 := 0; [L52] main_~lk8~0 := 0; [L56-L58] assume !(0 != main_~p1~0); [L60-L62] assume !(0 != main_~p2~0); [L64-L66] assume !(0 != main_~p3~0); [L68-L70] assume !(0 != main_~p4~0); [L72-L74] assume !(0 != main_~p5~0); [L76-L78] assume !(0 != main_~p6~0); [L80-L82] assume !(0 != main_~p7~0); [L84-L86] assume !(0 != main_~p8~0); [L90-L93] assume !(0 != main_~p1~0); [L95-L98] assume !(0 != main_~p2~0); [L100-L103] assume !(0 != main_~p3~0); [L105-L108] assume !(0 != main_~p4~0); [L110-L113] assume !(0 != main_~p5~0); [L115-L118] assume !(0 != main_~p6~0); [L120-L123] assume !(0 != main_~p7~0); [L125-L128] assume !(0 != main_~p8~0); [L33-L130] COND FALSE !(false) [L34] main_~cond~0 := main_#t~nondet8; [L34] havoc main_#t~nondet8; [L35] COND FALSE !(0 == main_~cond~0) [L38] main_~lk1~0 := 0; [L40] main_~lk2~0 := 0; [L42] main_~lk3~0 := 0; [L44] main_~lk4~0 := 0; [L46] main_~lk5~0 := 0; [L48] main_~lk6~0 := 0; [L50] main_~lk7~0 := 0; [L52] main_~lk8~0 := 0; [L56] COND FALSE !(0 != main_~p1~0) [L60] COND FALSE !(0 != main_~p2~0) [L64] COND FALSE !(0 != main_~p3~0) [L68] COND FALSE !(0 != main_~p4~0) [L72] COND FALSE !(0 != main_~p5~0) [L76] COND FALSE !(0 != main_~p6~0) [L80] COND FALSE !(0 != main_~p7~0) [L84] COND FALSE !(0 != main_~p8~0) [L90] COND FALSE !(0 != main_~p1~0) [L95] COND FALSE !(0 != main_~p2~0) [L100] COND FALSE !(0 != main_~p3~0) [L105] COND FALSE !(0 != main_~p4~0) [L110] COND FALSE !(0 != main_~p5~0) [L115] COND FALSE !(0 != main_~p6~0) [L120] COND FALSE !(0 != main_~p7~0) [L125] COND FALSE !(0 != main_~p8~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L33-L130] COND FALSE !(false) [L34] main_~cond~0 := main_#t~nondet8; [L34] havoc main_#t~nondet8; [L35] COND FALSE !(0 == main_~cond~0) [L38] main_~lk1~0 := 0; [L40] main_~lk2~0 := 0; [L42] main_~lk3~0 := 0; [L44] main_~lk4~0 := 0; [L46] main_~lk5~0 := 0; [L48] main_~lk6~0 := 0; [L50] main_~lk7~0 := 0; [L52] main_~lk8~0 := 0; [L56] COND FALSE !(0 != main_~p1~0) [L60] COND FALSE !(0 != main_~p2~0) [L64] COND FALSE !(0 != main_~p3~0) [L68] COND FALSE !(0 != main_~p4~0) [L72] COND FALSE !(0 != main_~p5~0) [L76] COND FALSE !(0 != main_~p6~0) [L80] COND FALSE !(0 != main_~p7~0) [L84] COND FALSE !(0 != main_~p8~0) [L90] COND FALSE !(0 != main_~p1~0) [L95] COND FALSE !(0 != main_~p2~0) [L100] COND FALSE !(0 != main_~p3~0) [L105] COND FALSE !(0 != main_~p4~0) [L110] COND FALSE !(0 != main_~p5~0) [L115] COND FALSE !(0 != main_~p6~0) [L120] COND FALSE !(0 != main_~p7~0) [L125] COND FALSE !(0 != main_~p8~0) [L33-L130] COND FALSE !(false) [L34] ~cond~0 := #t~nondet8; [L34] havoc #t~nondet8; [L35] COND FALSE !(0 == ~cond~0) [L38] ~lk1~0 := 0; [L40] ~lk2~0 := 0; [L42] ~lk3~0 := 0; [L44] ~lk4~0 := 0; [L46] ~lk5~0 := 0; [L48] ~lk6~0 := 0; [L50] ~lk7~0 := 0; [L52] ~lk8~0 := 0; [L56] COND FALSE !(0 != ~p1~0) [L60] COND FALSE !(0 != ~p2~0) [L64] COND FALSE !(0 != ~p3~0) [L68] COND FALSE !(0 != ~p4~0) [L72] COND FALSE !(0 != ~p5~0) [L76] COND FALSE !(0 != ~p6~0) [L80] COND FALSE !(0 != ~p7~0) [L84] COND FALSE !(0 != ~p8~0) [L90] COND FALSE !(0 != ~p1~0) [L95] COND FALSE !(0 != ~p2~0) [L100] COND FALSE !(0 != ~p3~0) [L105] COND FALSE !(0 != ~p4~0) [L110] COND FALSE !(0 != ~p5~0) [L115] COND FALSE !(0 != ~p6~0) [L120] COND FALSE !(0 != ~p7~0) [L125] COND FALSE !(0 != ~p8~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L33-L130] COND FALSE !(false) [L34] ~cond~0 := #t~nondet8; [L34] havoc #t~nondet8; [L35] COND FALSE !(0 == ~cond~0) [L38] ~lk1~0 := 0; [L40] ~lk2~0 := 0; [L42] ~lk3~0 := 0; [L44] ~lk4~0 := 0; [L46] ~lk5~0 := 0; [L48] ~lk6~0 := 0; [L50] ~lk7~0 := 0; [L52] ~lk8~0 := 0; [L56] COND FALSE !(0 != ~p1~0) [L60] COND FALSE !(0 != ~p2~0) [L64] COND FALSE !(0 != ~p3~0) [L68] COND FALSE !(0 != ~p4~0) [L72] COND FALSE !(0 != ~p5~0) [L76] COND FALSE !(0 != ~p6~0) [L80] COND FALSE !(0 != ~p7~0) [L84] COND FALSE !(0 != ~p8~0) [L90] COND FALSE !(0 != ~p1~0) [L95] COND FALSE !(0 != ~p2~0) [L100] COND FALSE !(0 != ~p3~0) [L105] COND FALSE !(0 != ~p4~0) [L110] COND FALSE !(0 != ~p5~0) [L115] COND FALSE !(0 != ~p6~0) [L120] COND FALSE !(0 != ~p7~0) [L125] COND FALSE !(0 != ~p8~0) [L33] COND TRUE 1 [L34] cond = __VERIFIER_nondet_int() [L35] COND FALSE !(cond == 0) [L38] lk1 = 0 [L40] lk2 = 0 [L42] lk3 = 0 [L44] lk4 = 0 [L46] lk5 = 0 [L48] lk6 = 0 [L50] lk7 = 0 [L52] lk8 = 0 [L56] COND FALSE !(p1 != 0) [L60] COND FALSE !(p2 != 0) [L64] COND FALSE !(p3 != 0) [L68] COND FALSE !(p4 != 0) [L72] COND FALSE !(p5 != 0) [L76] COND FALSE !(p6 != 0) [L80] COND FALSE !(p7 != 0) [L84] COND FALSE !(p8 != 0) [L90] COND FALSE !(p1 != 0) [L95] COND FALSE !(p2 != 0) [L100] COND FALSE !(p3 != 0) [L105] COND FALSE !(p4 != 0) [L110] COND FALSE !(p5 != 0) [L115] COND FALSE !(p6 != 0) [L120] COND FALSE !(p7 != 0) [L125] COND FALSE !(p8 != 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; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L31] int cond; Loop: [L33] COND TRUE 1 [L34] cond = __VERIFIER_nondet_int() [L35] COND FALSE !(cond == 0) [L38] lk1 = 0 [L40] lk2 = 0 [L42] lk3 = 0 [L44] lk4 = 0 [L46] lk5 = 0 [L48] lk6 = 0 [L50] lk7 = 0 [L52] lk8 = 0 [L56] COND FALSE !(p1 != 0) [L60] COND FALSE !(p2 != 0) [L64] COND FALSE !(p3 != 0) [L68] COND FALSE !(p4 != 0) [L72] COND FALSE !(p5 != 0) [L76] COND FALSE !(p6 != 0) [L80] COND FALSE !(p7 != 0) [L84] COND FALSE !(p8 != 0) [L90] COND FALSE !(p1 != 0) [L95] COND FALSE !(p2 != 0) [L100] COND FALSE !(p3 != 0) [L105] COND FALSE !(p4 != 0) [L110] COND FALSE !(p5 != 0) [L115] COND FALSE !(p6 != 0) [L120] COND FALSE !(p7 != 0) [L125] COND FALSE !(p8 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...