./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_5_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_e1e78d40-7028-4a43-bd5e-197eaa440470/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e1e78d40-7028-4a43-bd5e-197eaa440470/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e1e78d40-7028-4a43-bd5e-197eaa440470/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e1e78d40-7028-4a43-bd5e-197eaa440470/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e1e78d40-7028-4a43-bd5e-197eaa440470/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e1e78d40-7028-4a43-bd5e-197eaa440470/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 4f33d015f37d4475f0ca85a8ea6311ffc3e89abb ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 04:53:17,003 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 04:53:17,004 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 04:53:17,010 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 04:53:17,011 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 04:53:17,011 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 04:53:17,012 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 04:53:17,013 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 04:53:17,014 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 04:53:17,015 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 04:53:17,016 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 04:53:17,016 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 04:53:17,017 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 04:53:17,017 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 04:53:17,018 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 04:53:17,019 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 04:53:17,019 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 04:53:17,020 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 04:53:17,022 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 04:53:17,023 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 04:53:17,024 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 04:53:17,025 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 04:53:17,026 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 04:53:17,026 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 04:53:17,026 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 04:53:17,027 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 04:53:17,028 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 04:53:17,028 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 04:53:17,029 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 04:53:17,030 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 04:53:17,030 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 04:53:17,030 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 04:53:17,030 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 04:53:17,031 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 04:53:17,031 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 04:53:17,032 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 04:53:17,032 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e1e78d40-7028-4a43-bd5e-197eaa440470/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 04:53:17,042 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 04:53:17,043 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 04:53:17,043 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 04:53:17,044 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 04:53:17,044 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 04:53:17,044 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 04:53:17,044 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 04:53:17,044 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 04:53:17,044 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 04:53:17,044 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 04:53:17,045 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 04:53:17,045 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 04:53:17,045 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 04:53:17,045 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 04:53:17,045 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 04:53:17,045 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 04:53:17,045 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 04:53:17,046 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 04:53:17,046 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 04:53:17,046 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 04:53:17,046 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 04:53:17,046 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 04:53:17,046 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 04:53:17,046 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 04:53:17,047 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 04:53:17,047 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 04:53:17,047 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 04:53:17,047 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 04:53:17,047 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 04:53:17,047 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 04:53:17,047 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 04:53:17,048 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 04:53:17,048 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_e1e78d40-7028-4a43-bd5e-197eaa440470/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 -> 4f33d015f37d4475f0ca85a8ea6311ffc3e89abb [2018-11-23 04:53:17,071 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 04:53:17,080 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 04:53:17,083 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 04:53:17,084 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 04:53:17,084 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 04:53:17,085 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e1e78d40-7028-4a43-bd5e-197eaa440470/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 04:53:17,122 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e1e78d40-7028-4a43-bd5e-197eaa440470/bin-2019/uautomizer/data/89038fb78/8ffbba32a3044f9e86ce9dfdb2d0aa83/FLAG236925c86 [2018-11-23 04:53:17,515 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 04:53:17,515 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e1e78d40-7028-4a43-bd5e-197eaa440470/sv-benchmarks/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 04:53:17,520 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e1e78d40-7028-4a43-bd5e-197eaa440470/bin-2019/uautomizer/data/89038fb78/8ffbba32a3044f9e86ce9dfdb2d0aa83/FLAG236925c86 [2018-11-23 04:53:17,531 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e1e78d40-7028-4a43-bd5e-197eaa440470/bin-2019/uautomizer/data/89038fb78/8ffbba32a3044f9e86ce9dfdb2d0aa83 [2018-11-23 04:53:17,534 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 04:53:17,535 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 04:53:17,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 04:53:17,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 04:53:17,537 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 04:53:17,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:53:17" (1/1) ... [2018-11-23 04:53:17,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22877cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:53:17, skipping insertion in model container [2018-11-23 04:53:17,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:53:17" (1/1) ... [2018-11-23 04:53:17,545 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 04:53:17,557 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 04:53:17,665 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:53:17,667 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 04:53:17,678 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:53:17,686 INFO L195 MainTranslator]: Completed translation [2018-11-23 04:53:17,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:53:17 WrapperNode [2018-11-23 04:53:17,687 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 04:53:17,687 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 04:53:17,687 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 04:53:17,687 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 04:53:17,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:53:17" (1/1) ... [2018-11-23 04:53:17,699 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:53:17" (1/1) ... [2018-11-23 04:53:17,714 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 04:53:17,715 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 04:53:17,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 04:53:17,715 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 04:53:17,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:53:17" (1/1) ... [2018-11-23 04:53:17,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:53:17" (1/1) ... [2018-11-23 04:53:17,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:53:17" (1/1) ... [2018-11-23 04:53:17,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:53:17" (1/1) ... [2018-11-23 04:53:17,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:53:17" (1/1) ... [2018-11-23 04:53:17,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:53:17" (1/1) ... [2018-11-23 04:53:17,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:53:17" (1/1) ... [2018-11-23 04:53:17,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 04:53:17,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 04:53:17,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 04:53:17,770 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 04:53:17,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:53:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e1e78d40-7028-4a43-bd5e-197eaa440470/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 04:53:17,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 04:53:17,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 04:53:17,927 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 04:53:17,927 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 04:53:17,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:53:17 BoogieIcfgContainer [2018-11-23 04:53:17,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 04:53:17,928 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 04:53:17,928 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 04:53:17,931 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 04:53:17,931 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 04:53:17,932 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 04:53:17" (1/3) ... [2018-11-23 04:53:17,933 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ba54b8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 04:53:17, skipping insertion in model container [2018-11-23 04:53:17,933 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 04:53:17,933 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:53:17" (2/3) ... [2018-11-23 04:53:17,933 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ba54b8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 04:53:17, skipping insertion in model container [2018-11-23 04:53:17,933 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 04:53:17,934 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:53:17" (3/3) ... [2018-11-23 04:53:17,935 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 04:53:17,984 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 04:53:17,985 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 04:53:17,985 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 04:53:17,985 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 04:53:17,985 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 04:53:17,985 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 04:53:17,985 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 04:53:17,985 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 04:53:17,985 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 04:53:17,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-23 04:53:18,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-23 04:53:18,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:53:18,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:53:18,022 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 04:53:18,023 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:53:18,023 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 04:53:18,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-23 04:53:18,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-23 04:53:18,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:53:18,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:53:18,025 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 04:53:18,025 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:53:18,032 INFO L794 eck$LassoCheckResult]: Stem: 17#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_~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_~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;havoc main_~cond~0; 9#L83-1true [2018-11-23 04:53:18,032 INFO L796 eck$LassoCheckResult]: Loop: 9#L83-1true assume !false;main_~cond~0 := main_#t~nondet5;havoc main_#t~nondet5; 4#L26true 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; 13#L41true assume 0 != main_~p1~0;main_~lk1~0 := 1; 8#L41-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 19#L45-1true assume !(0 != main_~p3~0); 6#L49-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 14#L53-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 22#L57-1true assume !(0 != main_~p1~0); 12#L63-1true assume !(0 != main_~p2~0); 24#L68-1true assume !(0 != main_~p3~0); 10#L73-1true assume !(0 != main_~p4~0); 21#L78-1true assume !(0 != main_~p5~0); 9#L83-1true [2018-11-23 04:53:18,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:53:18,037 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-11-23 04:53:18,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:53:18,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:53:18,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:18,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:53:18,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:53:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:53:18,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:53:18,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1077541325, now seen corresponding path program 1 times [2018-11-23 04:53:18,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:53:18,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:53:18,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:18,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:53:18,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:53:18,164 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 04:53:18,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:53:18,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:53:18,169 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 04:53:18,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:53:18,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:53:18,180 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-11-23 04:53:18,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:53:18,214 INFO L93 Difference]: Finished difference Result 44 states and 69 transitions. [2018-11-23 04:53:18,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:53:18,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 69 transitions. [2018-11-23 04:53:18,216 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2018-11-23 04:53:18,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 34 states and 52 transitions. [2018-11-23 04:53:18,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-11-23 04:53:18,220 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-11-23 04:53:18,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 52 transitions. [2018-11-23 04:53:18,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:53:18,221 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 52 transitions. [2018-11-23 04:53:18,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 52 transitions. [2018-11-23 04:53:18,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 04:53:18,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 04:53:18,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 52 transitions. [2018-11-23 04:53:18,244 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 52 transitions. [2018-11-23 04:53:18,244 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 52 transitions. [2018-11-23 04:53:18,244 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 04:53:18,245 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 52 transitions. [2018-11-23 04:53:18,245 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2018-11-23 04:53:18,245 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:53:18,246 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:53:18,246 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 04:53:18,246 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:53:18,246 INFO L794 eck$LassoCheckResult]: Stem: 95#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_~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_~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;havoc main_~cond~0; 96#L83-1 [2018-11-23 04:53:18,246 INFO L796 eck$LassoCheckResult]: Loop: 96#L83-1 assume !false;main_~cond~0 := main_#t~nondet5;havoc main_#t~nondet5; 103#L26 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; 102#L41 assume !(0 != main_~p1~0); 84#L41-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 85#L45-1 assume !(0 != main_~p3~0); 101#L49-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 91#L53-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 92#L57-1 assume !(0 != main_~p1~0); 88#L63-1 assume !(0 != main_~p2~0); 81#L68-1 assume !(0 != main_~p3~0); 94#L73-1 assume !(0 != main_~p4~0); 105#L78-1 assume !(0 != main_~p5~0); 96#L83-1 [2018-11-23 04:53:18,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:53:18,247 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2018-11-23 04:53:18,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:53:18,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:53:18,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:18,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:53:18,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:53:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:53:18,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:53:18,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1470568335, now seen corresponding path program 1 times [2018-11-23 04:53:18,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:53:18,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:53:18,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:18,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:53:18,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:53:18,272 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 04:53:18,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:53:18,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:53:18,273 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 04:53:18,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:53:18,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:53:18,274 INFO L87 Difference]: Start difference. First operand 34 states and 52 transitions. cyclomatic complexity: 20 Second operand 3 states. [2018-11-23 04:53:18,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:53:18,290 INFO L93 Difference]: Finished difference Result 65 states and 97 transitions. [2018-11-23 04:53:18,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:53:18,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 97 transitions. [2018-11-23 04:53:18,293 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 64 [2018-11-23 04:53:18,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 97 transitions. [2018-11-23 04:53:18,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2018-11-23 04:53:18,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2018-11-23 04:53:18,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 97 transitions. [2018-11-23 04:53:18,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:53:18,296 INFO L705 BuchiCegarLoop]: Abstraction has 65 states and 97 transitions. [2018-11-23 04:53:18,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 97 transitions. [2018-11-23 04:53:18,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-23 04:53:18,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 04:53:18,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 97 transitions. [2018-11-23 04:53:18,301 INFO L728 BuchiCegarLoop]: Abstraction has 65 states and 97 transitions. [2018-11-23 04:53:18,302 INFO L608 BuchiCegarLoop]: Abstraction has 65 states and 97 transitions. [2018-11-23 04:53:18,302 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 04:53:18,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 97 transitions. [2018-11-23 04:53:18,303 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 64 [2018-11-23 04:53:18,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:53:18,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:53:18,304 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 04:53:18,304 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:53:18,304 INFO L794 eck$LassoCheckResult]: Stem: 202#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_~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_~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;havoc main_~cond~0; 203#L83-1 [2018-11-23 04:53:18,304 INFO L796 eck$LassoCheckResult]: Loop: 203#L83-1 assume !false;main_~cond~0 := main_#t~nondet5;havoc main_#t~nondet5; 212#L26 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; 209#L41 assume !(0 != main_~p1~0); 210#L41-2 assume !(0 != main_~p2~0); 232#L45-1 assume !(0 != main_~p3~0); 231#L49-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 230#L53-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 229#L57-1 assume !(0 != main_~p1~0); 228#L63-1 assume !(0 != main_~p2~0); 225#L68-1 assume !(0 != main_~p3~0); 221#L73-1 assume !(0 != main_~p4~0); 217#L78-1 assume !(0 != main_~p5~0); 203#L83-1 [2018-11-23 04:53:18,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:53:18,304 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2018-11-23 04:53:18,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:53:18,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:53:18,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:18,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:53:18,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:53:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:53:18,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:53:18,309 INFO L82 PathProgramCache]: Analyzing trace with hash -790509965, now seen corresponding path program 1 times [2018-11-23 04:53:18,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:53:18,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:53:18,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:18,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:53:18,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:53:18,324 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 04:53:18,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:53:18,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:53:18,325 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 04:53:18,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:53:18,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:53:18,325 INFO L87 Difference]: Start difference. First operand 65 states and 97 transitions. cyclomatic complexity: 36 Second operand 3 states. [2018-11-23 04:53:18,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:53:18,339 INFO L93 Difference]: Finished difference Result 125 states and 181 transitions. [2018-11-23 04:53:18,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:53:18,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 181 transitions. [2018-11-23 04:53:18,341 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 124 [2018-11-23 04:53:18,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 181 transitions. [2018-11-23 04:53:18,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2018-11-23 04:53:18,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2018-11-23 04:53:18,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 181 transitions. [2018-11-23 04:53:18,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:53:18,344 INFO L705 BuchiCegarLoop]: Abstraction has 125 states and 181 transitions. [2018-11-23 04:53:18,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 181 transitions. [2018-11-23 04:53:18,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-11-23 04:53:18,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-23 04:53:18,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 181 transitions. [2018-11-23 04:53:18,349 INFO L728 BuchiCegarLoop]: Abstraction has 125 states and 181 transitions. [2018-11-23 04:53:18,349 INFO L608 BuchiCegarLoop]: Abstraction has 125 states and 181 transitions. [2018-11-23 04:53:18,349 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 04:53:18,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 181 transitions. [2018-11-23 04:53:18,351 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 124 [2018-11-23 04:53:18,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:53:18,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:53:18,351 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 04:53:18,351 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:53:18,351 INFO L794 eck$LassoCheckResult]: Stem: 398#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_~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_~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;havoc main_~cond~0; 399#L83-1 [2018-11-23 04:53:18,352 INFO L796 eck$LassoCheckResult]: Loop: 399#L83-1 assume !false;main_~cond~0 := main_#t~nondet5;havoc main_#t~nondet5; 411#L26 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; 412#L41 assume !(0 != main_~p1~0); 460#L41-2 assume !(0 != main_~p2~0); 457#L45-1 assume !(0 != main_~p3~0); 453#L49-1 assume !(0 != main_~p4~0); 449#L53-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 447#L57-1 assume !(0 != main_~p1~0); 445#L63-1 assume !(0 != main_~p2~0); 442#L68-1 assume !(0 != main_~p3~0); 438#L73-1 assume !(0 != main_~p4~0); 439#L78-1 assume !(0 != main_~p5~0); 399#L83-1 [2018-11-23 04:53:18,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:53:18,352 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2018-11-23 04:53:18,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:53:18,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:53:18,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:18,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:53:18,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:53:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:53:18,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:53:18,356 INFO L82 PathProgramCache]: Analyzing trace with hash 984497397, now seen corresponding path program 1 times [2018-11-23 04:53:18,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:53:18,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:53:18,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:18,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:53:18,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:53:18,371 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 04:53:18,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:53:18,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 04:53:18,371 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 04:53:18,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:53:18,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:53:18,372 INFO L87 Difference]: Start difference. First operand 125 states and 181 transitions. cyclomatic complexity: 64 Second operand 3 states. [2018-11-23 04:53:18,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:53:18,390 INFO L93 Difference]: Finished difference Result 241 states and 337 transitions. [2018-11-23 04:53:18,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:53:18,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 241 states and 337 transitions. [2018-11-23 04:53:18,393 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 240 [2018-11-23 04:53:18,394 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 241 states to 241 states and 337 transitions. [2018-11-23 04:53:18,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 241 [2018-11-23 04:53:18,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 241 [2018-11-23 04:53:18,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 241 states and 337 transitions. [2018-11-23 04:53:18,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:53:18,396 INFO L705 BuchiCegarLoop]: Abstraction has 241 states and 337 transitions. [2018-11-23 04:53:18,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states and 337 transitions. [2018-11-23 04:53:18,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-11-23 04:53:18,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-11-23 04:53:18,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 337 transitions. [2018-11-23 04:53:18,405 INFO L728 BuchiCegarLoop]: Abstraction has 241 states and 337 transitions. [2018-11-23 04:53:18,406 INFO L608 BuchiCegarLoop]: Abstraction has 241 states and 337 transitions. [2018-11-23 04:53:18,406 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 04:53:18,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 241 states and 337 transitions. [2018-11-23 04:53:18,407 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 240 [2018-11-23 04:53:18,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:53:18,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:53:18,408 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 04:53:18,408 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:53:18,408 INFO L794 eck$LassoCheckResult]: Stem: 770#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_~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_~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;havoc main_~cond~0; 771#L83-1 [2018-11-23 04:53:18,408 INFO L796 eck$LassoCheckResult]: Loop: 771#L83-1 assume !false;main_~cond~0 := main_#t~nondet5;havoc main_#t~nondet5; 832#L26 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; 826#L41 assume !(0 != main_~p1~0); 820#L41-2 assume !(0 != main_~p2~0); 814#L45-1 assume !(0 != main_~p3~0); 815#L49-1 assume !(0 != main_~p4~0); 865#L53-1 assume !(0 != main_~p5~0); 864#L57-1 assume !(0 != main_~p1~0); 862#L63-1 assume !(0 != main_~p2~0); 860#L68-1 assume !(0 != main_~p3~0); 857#L73-1 assume !(0 != main_~p4~0); 841#L78-1 assume !(0 != main_~p5~0); 771#L83-1 [2018-11-23 04:53:18,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:53:18,408 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2018-11-23 04:53:18,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:53:18,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:53:18,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:18,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:53:18,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:53:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:53:18,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:53:18,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1041755699, now seen corresponding path program 1 times [2018-11-23 04:53:18,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:53:18,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:53:18,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:18,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:53:18,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:53:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:53:18,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:53:18,422 INFO L82 PathProgramCache]: Analyzing trace with hash 536197074, now seen corresponding path program 1 times [2018-11-23 04:53:18,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:53:18,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:53:18,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:18,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:53:18,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:53:18,428 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_~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_~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;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_~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_~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; [L22] 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_~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_~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; [L22] 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_~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_~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; [L22] 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_~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_~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; [L22] 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; [L22] 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; [L22] 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; [L22] int cond; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false;main_~cond~0 := main_#t~nondet5;havoc main_#t~nondet5; [?] 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; [?] 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_~p1~0); [?] assume !(0 != main_~p2~0); [?] assume !(0 != main_~p3~0); [?] assume !(0 != main_~p4~0); [?] assume !(0 != main_~p5~0); [L24-L88] assume !false; [L25] main_~cond~0 := main_#t~nondet5; [L25] havoc main_#t~nondet5; [L26-L28] assume !(0 == main_~cond~0); [L29] main_~lk1~0 := 0; [L31] main_~lk2~0 := 0; [L33] main_~lk3~0 := 0; [L35] main_~lk4~0 := 0; [L37] main_~lk5~0 := 0; [L41-L43] assume !(0 != main_~p1~0); [L45-L47] assume !(0 != main_~p2~0); [L49-L51] assume !(0 != main_~p3~0); [L53-L55] assume !(0 != main_~p4~0); [L57-L59] assume !(0 != main_~p5~0); [L63-L66] assume !(0 != main_~p1~0); [L68-L71] assume !(0 != main_~p2~0); [L73-L76] assume !(0 != main_~p3~0); [L78-L81] assume !(0 != main_~p4~0); [L83-L86] assume !(0 != main_~p5~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L24-L88] assume !false; [L25] main_~cond~0 := main_#t~nondet5; [L25] havoc main_#t~nondet5; [L26-L28] assume !(0 == main_~cond~0); [L29] main_~lk1~0 := 0; [L31] main_~lk2~0 := 0; [L33] main_~lk3~0 := 0; [L35] main_~lk4~0 := 0; [L37] main_~lk5~0 := 0; [L41-L43] assume !(0 != main_~p1~0); [L45-L47] assume !(0 != main_~p2~0); [L49-L51] assume !(0 != main_~p3~0); [L53-L55] assume !(0 != main_~p4~0); [L57-L59] assume !(0 != main_~p5~0); [L63-L66] assume !(0 != main_~p1~0); [L68-L71] assume !(0 != main_~p2~0); [L73-L76] assume !(0 != main_~p3~0); [L78-L81] assume !(0 != main_~p4~0); [L83-L86] assume !(0 != main_~p5~0); [L24-L88] COND FALSE !(false) [L25] main_~cond~0 := main_#t~nondet5; [L25] havoc main_#t~nondet5; [L26] COND FALSE !(0 == main_~cond~0) [L29] main_~lk1~0 := 0; [L31] main_~lk2~0 := 0; [L33] main_~lk3~0 := 0; [L35] main_~lk4~0 := 0; [L37] main_~lk5~0 := 0; [L41] COND FALSE !(0 != main_~p1~0) [L45] COND FALSE !(0 != main_~p2~0) [L49] COND FALSE !(0 != main_~p3~0) [L53] COND FALSE !(0 != main_~p4~0) [L57] COND FALSE !(0 != main_~p5~0) [L63] COND FALSE !(0 != main_~p1~0) [L68] COND FALSE !(0 != main_~p2~0) [L73] COND FALSE !(0 != main_~p3~0) [L78] COND FALSE !(0 != main_~p4~0) [L83] COND FALSE !(0 != main_~p5~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L24-L88] COND FALSE !(false) [L25] main_~cond~0 := main_#t~nondet5; [L25] havoc main_#t~nondet5; [L26] COND FALSE !(0 == main_~cond~0) [L29] main_~lk1~0 := 0; [L31] main_~lk2~0 := 0; [L33] main_~lk3~0 := 0; [L35] main_~lk4~0 := 0; [L37] main_~lk5~0 := 0; [L41] COND FALSE !(0 != main_~p1~0) [L45] COND FALSE !(0 != main_~p2~0) [L49] COND FALSE !(0 != main_~p3~0) [L53] COND FALSE !(0 != main_~p4~0) [L57] COND FALSE !(0 != main_~p5~0) [L63] COND FALSE !(0 != main_~p1~0) [L68] COND FALSE !(0 != main_~p2~0) [L73] COND FALSE !(0 != main_~p3~0) [L78] COND FALSE !(0 != main_~p4~0) [L83] COND FALSE !(0 != main_~p5~0) [L24-L88] COND FALSE !(false) [L25] ~cond~0 := #t~nondet5; [L25] havoc #t~nondet5; [L26] COND FALSE !(0 == ~cond~0) [L29] ~lk1~0 := 0; [L31] ~lk2~0 := 0; [L33] ~lk3~0 := 0; [L35] ~lk4~0 := 0; [L37] ~lk5~0 := 0; [L41] COND FALSE !(0 != ~p1~0) [L45] COND FALSE !(0 != ~p2~0) [L49] COND FALSE !(0 != ~p3~0) [L53] COND FALSE !(0 != ~p4~0) [L57] COND FALSE !(0 != ~p5~0) [L63] COND FALSE !(0 != ~p1~0) [L68] COND FALSE !(0 != ~p2~0) [L73] COND FALSE !(0 != ~p3~0) [L78] COND FALSE !(0 != ~p4~0) [L83] COND FALSE !(0 != ~p5~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L24-L88] COND FALSE !(false) [L25] ~cond~0 := #t~nondet5; [L25] havoc #t~nondet5; [L26] COND FALSE !(0 == ~cond~0) [L29] ~lk1~0 := 0; [L31] ~lk2~0 := 0; [L33] ~lk3~0 := 0; [L35] ~lk4~0 := 0; [L37] ~lk5~0 := 0; [L41] COND FALSE !(0 != ~p1~0) [L45] COND FALSE !(0 != ~p2~0) [L49] COND FALSE !(0 != ~p3~0) [L53] COND FALSE !(0 != ~p4~0) [L57] COND FALSE !(0 != ~p5~0) [L63] COND FALSE !(0 != ~p1~0) [L68] COND FALSE !(0 != ~p2~0) [L73] COND FALSE !(0 != ~p3~0) [L78] COND FALSE !(0 != ~p4~0) [L83] COND FALSE !(0 != ~p5~0) [L24] COND TRUE 1 [L25] cond = __VERIFIER_nondet_int() [L26] COND FALSE !(cond == 0) [L29] lk1 = 0 [L31] lk2 = 0 [L33] lk3 = 0 [L35] lk4 = 0 [L37] lk5 = 0 [L41] COND FALSE !(p1 != 0) [L45] COND FALSE !(p2 != 0) [L49] COND FALSE !(p3 != 0) [L53] COND FALSE !(p4 != 0) [L57] COND FALSE !(p5 != 0) [L63] COND FALSE !(p1 != 0) [L68] COND FALSE !(p2 != 0) [L73] COND FALSE !(p3 != 0) [L78] COND FALSE !(p4 != 0) [L83] COND FALSE !(p5 != 0) ----- [2018-11-23 04:53:18,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 04:53:18 BoogieIcfgContainer [2018-11-23 04:53:18,552 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 04:53:18,552 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 04:53:18,552 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 04:53:18,553 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 04:53:18,553 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:53:17" (3/4) ... [2018-11-23 04:53:18,556 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_~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_~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;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_~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_~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; [L22] 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_~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_~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; [L22] 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_~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_~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; [L22] 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_~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_~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; [L22] 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; [L22] 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; [L22] 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; [L22] int cond; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false;main_~cond~0 := main_#t~nondet5;havoc main_#t~nondet5; [?] 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; [?] 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_~p1~0); [?] assume !(0 != main_~p2~0); [?] assume !(0 != main_~p3~0); [?] assume !(0 != main_~p4~0); [?] assume !(0 != main_~p5~0); [L24-L88] assume !false; [L25] main_~cond~0 := main_#t~nondet5; [L25] havoc main_#t~nondet5; [L26-L28] assume !(0 == main_~cond~0); [L29] main_~lk1~0 := 0; [L31] main_~lk2~0 := 0; [L33] main_~lk3~0 := 0; [L35] main_~lk4~0 := 0; [L37] main_~lk5~0 := 0; [L41-L43] assume !(0 != main_~p1~0); [L45-L47] assume !(0 != main_~p2~0); [L49-L51] assume !(0 != main_~p3~0); [L53-L55] assume !(0 != main_~p4~0); [L57-L59] assume !(0 != main_~p5~0); [L63-L66] assume !(0 != main_~p1~0); [L68-L71] assume !(0 != main_~p2~0); [L73-L76] assume !(0 != main_~p3~0); [L78-L81] assume !(0 != main_~p4~0); [L83-L86] assume !(0 != main_~p5~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L24-L88] assume !false; [L25] main_~cond~0 := main_#t~nondet5; [L25] havoc main_#t~nondet5; [L26-L28] assume !(0 == main_~cond~0); [L29] main_~lk1~0 := 0; [L31] main_~lk2~0 := 0; [L33] main_~lk3~0 := 0; [L35] main_~lk4~0 := 0; [L37] main_~lk5~0 := 0; [L41-L43] assume !(0 != main_~p1~0); [L45-L47] assume !(0 != main_~p2~0); [L49-L51] assume !(0 != main_~p3~0); [L53-L55] assume !(0 != main_~p4~0); [L57-L59] assume !(0 != main_~p5~0); [L63-L66] assume !(0 != main_~p1~0); [L68-L71] assume !(0 != main_~p2~0); [L73-L76] assume !(0 != main_~p3~0); [L78-L81] assume !(0 != main_~p4~0); [L83-L86] assume !(0 != main_~p5~0); [L24-L88] COND FALSE !(false) [L25] main_~cond~0 := main_#t~nondet5; [L25] havoc main_#t~nondet5; [L26] COND FALSE !(0 == main_~cond~0) [L29] main_~lk1~0 := 0; [L31] main_~lk2~0 := 0; [L33] main_~lk3~0 := 0; [L35] main_~lk4~0 := 0; [L37] main_~lk5~0 := 0; [L41] COND FALSE !(0 != main_~p1~0) [L45] COND FALSE !(0 != main_~p2~0) [L49] COND FALSE !(0 != main_~p3~0) [L53] COND FALSE !(0 != main_~p4~0) [L57] COND FALSE !(0 != main_~p5~0) [L63] COND FALSE !(0 != main_~p1~0) [L68] COND FALSE !(0 != main_~p2~0) [L73] COND FALSE !(0 != main_~p3~0) [L78] COND FALSE !(0 != main_~p4~0) [L83] COND FALSE !(0 != main_~p5~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L24-L88] COND FALSE !(false) [L25] main_~cond~0 := main_#t~nondet5; [L25] havoc main_#t~nondet5; [L26] COND FALSE !(0 == main_~cond~0) [L29] main_~lk1~0 := 0; [L31] main_~lk2~0 := 0; [L33] main_~lk3~0 := 0; [L35] main_~lk4~0 := 0; [L37] main_~lk5~0 := 0; [L41] COND FALSE !(0 != main_~p1~0) [L45] COND FALSE !(0 != main_~p2~0) [L49] COND FALSE !(0 != main_~p3~0) [L53] COND FALSE !(0 != main_~p4~0) [L57] COND FALSE !(0 != main_~p5~0) [L63] COND FALSE !(0 != main_~p1~0) [L68] COND FALSE !(0 != main_~p2~0) [L73] COND FALSE !(0 != main_~p3~0) [L78] COND FALSE !(0 != main_~p4~0) [L83] COND FALSE !(0 != main_~p5~0) [L24-L88] COND FALSE !(false) [L25] ~cond~0 := #t~nondet5; [L25] havoc #t~nondet5; [L26] COND FALSE !(0 == ~cond~0) [L29] ~lk1~0 := 0; [L31] ~lk2~0 := 0; [L33] ~lk3~0 := 0; [L35] ~lk4~0 := 0; [L37] ~lk5~0 := 0; [L41] COND FALSE !(0 != ~p1~0) [L45] COND FALSE !(0 != ~p2~0) [L49] COND FALSE !(0 != ~p3~0) [L53] COND FALSE !(0 != ~p4~0) [L57] COND FALSE !(0 != ~p5~0) [L63] COND FALSE !(0 != ~p1~0) [L68] COND FALSE !(0 != ~p2~0) [L73] COND FALSE !(0 != ~p3~0) [L78] COND FALSE !(0 != ~p4~0) [L83] COND FALSE !(0 != ~p5~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L24-L88] COND FALSE !(false) [L25] ~cond~0 := #t~nondet5; [L25] havoc #t~nondet5; [L26] COND FALSE !(0 == ~cond~0) [L29] ~lk1~0 := 0; [L31] ~lk2~0 := 0; [L33] ~lk3~0 := 0; [L35] ~lk4~0 := 0; [L37] ~lk5~0 := 0; [L41] COND FALSE !(0 != ~p1~0) [L45] COND FALSE !(0 != ~p2~0) [L49] COND FALSE !(0 != ~p3~0) [L53] COND FALSE !(0 != ~p4~0) [L57] COND FALSE !(0 != ~p5~0) [L63] COND FALSE !(0 != ~p1~0) [L68] COND FALSE !(0 != ~p2~0) [L73] COND FALSE !(0 != ~p3~0) [L78] COND FALSE !(0 != ~p4~0) [L83] COND FALSE !(0 != ~p5~0) [L24] COND TRUE 1 [L25] cond = __VERIFIER_nondet_int() [L26] COND FALSE !(cond == 0) [L29] lk1 = 0 [L31] lk2 = 0 [L33] lk3 = 0 [L35] lk4 = 0 [L37] lk5 = 0 [L41] COND FALSE !(p1 != 0) [L45] COND FALSE !(p2 != 0) [L49] COND FALSE !(p3 != 0) [L53] COND FALSE !(p4 != 0) [L57] COND FALSE !(p5 != 0) [L63] COND FALSE !(p1 != 0) [L68] COND FALSE !(p2 != 0) [L73] COND FALSE !(p3 != 0) [L78] COND FALSE !(p4 != 0) [L83] COND FALSE !(p5 != 0) ----- [2018-11-23 04:53:18,590 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e1e78d40-7028-4a43-bd5e-197eaa440470/bin-2019/uautomizer/witness.graphml [2018-11-23 04:53:18,590 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 04:53:18,591 INFO L168 Benchmark]: Toolchain (without parser) took 1056.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 953.8 MB in the beginning and 1.1 GB in the end (delta: -102.1 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2018-11-23 04:53:18,592 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:53:18,592 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.61 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 04:53:18,593 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.19 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 04:53:18,593 INFO L168 Benchmark]: Boogie Preprocessor took 55.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -204.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-23 04:53:18,594 INFO L168 Benchmark]: RCFGBuilder took 157.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-11-23 04:53:18,594 INFO L168 Benchmark]: BuchiAutomizer took 624.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 67.9 MB). Peak memory consumption was 67.9 MB. Max. memory is 11.5 GB. [2018-11-23 04:53:18,595 INFO L168 Benchmark]: Witness Printer took 37.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 04:53:18,599 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 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 151.61 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.19 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -204.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 157.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 624.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 67.9 MB). Peak memory consumption was 67.9 MB. Max. memory is 11.5 GB. * Witness Printer took 37.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (4 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.4 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 241 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.5s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 0.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 241 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 173 SDtfs, 89 SDslu, 96 SDs, 0 SdLazy, 20 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI4 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: 24]: 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, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6b88254a=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@411cddef=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4e8a0d0=1, lk5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3ba2238f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d931448=0, lk1=0, lk2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5e0c237d=0, cond=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 24]: 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_~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_~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;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_~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_~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; [L22] 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_~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_~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; [L22] 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_~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_~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; [L22] 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_~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_~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; [L22] 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; [L22] 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; [L22] 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; [L22] int cond; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false;main_~cond~0 := main_#t~nondet5;havoc main_#t~nondet5; [?] 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; [?] 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_~p1~0); [?] assume !(0 != main_~p2~0); [?] assume !(0 != main_~p3~0); [?] assume !(0 != main_~p4~0); [?] assume !(0 != main_~p5~0); [L24-L88] assume !false; [L25] main_~cond~0 := main_#t~nondet5; [L25] havoc main_#t~nondet5; [L26-L28] assume !(0 == main_~cond~0); [L29] main_~lk1~0 := 0; [L31] main_~lk2~0 := 0; [L33] main_~lk3~0 := 0; [L35] main_~lk4~0 := 0; [L37] main_~lk5~0 := 0; [L41-L43] assume !(0 != main_~p1~0); [L45-L47] assume !(0 != main_~p2~0); [L49-L51] assume !(0 != main_~p3~0); [L53-L55] assume !(0 != main_~p4~0); [L57-L59] assume !(0 != main_~p5~0); [L63-L66] assume !(0 != main_~p1~0); [L68-L71] assume !(0 != main_~p2~0); [L73-L76] assume !(0 != main_~p3~0); [L78-L81] assume !(0 != main_~p4~0); [L83-L86] assume !(0 != main_~p5~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L24-L88] assume !false; [L25] main_~cond~0 := main_#t~nondet5; [L25] havoc main_#t~nondet5; [L26-L28] assume !(0 == main_~cond~0); [L29] main_~lk1~0 := 0; [L31] main_~lk2~0 := 0; [L33] main_~lk3~0 := 0; [L35] main_~lk4~0 := 0; [L37] main_~lk5~0 := 0; [L41-L43] assume !(0 != main_~p1~0); [L45-L47] assume !(0 != main_~p2~0); [L49-L51] assume !(0 != main_~p3~0); [L53-L55] assume !(0 != main_~p4~0); [L57-L59] assume !(0 != main_~p5~0); [L63-L66] assume !(0 != main_~p1~0); [L68-L71] assume !(0 != main_~p2~0); [L73-L76] assume !(0 != main_~p3~0); [L78-L81] assume !(0 != main_~p4~0); [L83-L86] assume !(0 != main_~p5~0); [L24-L88] COND FALSE !(false) [L25] main_~cond~0 := main_#t~nondet5; [L25] havoc main_#t~nondet5; [L26] COND FALSE !(0 == main_~cond~0) [L29] main_~lk1~0 := 0; [L31] main_~lk2~0 := 0; [L33] main_~lk3~0 := 0; [L35] main_~lk4~0 := 0; [L37] main_~lk5~0 := 0; [L41] COND FALSE !(0 != main_~p1~0) [L45] COND FALSE !(0 != main_~p2~0) [L49] COND FALSE !(0 != main_~p3~0) [L53] COND FALSE !(0 != main_~p4~0) [L57] COND FALSE !(0 != main_~p5~0) [L63] COND FALSE !(0 != main_~p1~0) [L68] COND FALSE !(0 != main_~p2~0) [L73] COND FALSE !(0 != main_~p3~0) [L78] COND FALSE !(0 != main_~p4~0) [L83] COND FALSE !(0 != main_~p5~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L24-L88] COND FALSE !(false) [L25] main_~cond~0 := main_#t~nondet5; [L25] havoc main_#t~nondet5; [L26] COND FALSE !(0 == main_~cond~0) [L29] main_~lk1~0 := 0; [L31] main_~lk2~0 := 0; [L33] main_~lk3~0 := 0; [L35] main_~lk4~0 := 0; [L37] main_~lk5~0 := 0; [L41] COND FALSE !(0 != main_~p1~0) [L45] COND FALSE !(0 != main_~p2~0) [L49] COND FALSE !(0 != main_~p3~0) [L53] COND FALSE !(0 != main_~p4~0) [L57] COND FALSE !(0 != main_~p5~0) [L63] COND FALSE !(0 != main_~p1~0) [L68] COND FALSE !(0 != main_~p2~0) [L73] COND FALSE !(0 != main_~p3~0) [L78] COND FALSE !(0 != main_~p4~0) [L83] COND FALSE !(0 != main_~p5~0) [L24-L88] COND FALSE !(false) [L25] ~cond~0 := #t~nondet5; [L25] havoc #t~nondet5; [L26] COND FALSE !(0 == ~cond~0) [L29] ~lk1~0 := 0; [L31] ~lk2~0 := 0; [L33] ~lk3~0 := 0; [L35] ~lk4~0 := 0; [L37] ~lk5~0 := 0; [L41] COND FALSE !(0 != ~p1~0) [L45] COND FALSE !(0 != ~p2~0) [L49] COND FALSE !(0 != ~p3~0) [L53] COND FALSE !(0 != ~p4~0) [L57] COND FALSE !(0 != ~p5~0) [L63] COND FALSE !(0 != ~p1~0) [L68] COND FALSE !(0 != ~p2~0) [L73] COND FALSE !(0 != ~p3~0) [L78] COND FALSE !(0 != ~p4~0) [L83] COND FALSE !(0 != ~p5~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L24-L88] COND FALSE !(false) [L25] ~cond~0 := #t~nondet5; [L25] havoc #t~nondet5; [L26] COND FALSE !(0 == ~cond~0) [L29] ~lk1~0 := 0; [L31] ~lk2~0 := 0; [L33] ~lk3~0 := 0; [L35] ~lk4~0 := 0; [L37] ~lk5~0 := 0; [L41] COND FALSE !(0 != ~p1~0) [L45] COND FALSE !(0 != ~p2~0) [L49] COND FALSE !(0 != ~p3~0) [L53] COND FALSE !(0 != ~p4~0) [L57] COND FALSE !(0 != ~p5~0) [L63] COND FALSE !(0 != ~p1~0) [L68] COND FALSE !(0 != ~p2~0) [L73] COND FALSE !(0 != ~p3~0) [L78] COND FALSE !(0 != ~p4~0) [L83] COND FALSE !(0 != ~p5~0) [L24] COND TRUE 1 [L25] cond = __VERIFIER_nondet_int() [L26] COND FALSE !(cond == 0) [L29] lk1 = 0 [L31] lk2 = 0 [L33] lk3 = 0 [L35] lk4 = 0 [L37] lk5 = 0 [L41] COND FALSE !(p1 != 0) [L45] COND FALSE !(p2 != 0) [L49] COND FALSE !(p3 != 0) [L53] COND FALSE !(p4 != 0) [L57] COND FALSE !(p5 != 0) [L63] COND FALSE !(p1 != 0) [L68] COND FALSE !(p2 != 0) [L73] COND FALSE !(p3 != 0) [L78] COND FALSE !(p4 != 0) [L83] COND FALSE !(p5 != 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_~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_~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;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_~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_~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; [L22] 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_~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_~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; [L22] 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_~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_~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; [L22] 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_~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_~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; [L22] 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; [L22] 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; [L22] 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; [L22] int cond; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false;main_~cond~0 := main_#t~nondet5;havoc main_#t~nondet5; [?] 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; [?] 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_~p1~0); [?] assume !(0 != main_~p2~0); [?] assume !(0 != main_~p3~0); [?] assume !(0 != main_~p4~0); [?] assume !(0 != main_~p5~0); [L24-L88] assume !false; [L25] main_~cond~0 := main_#t~nondet5; [L25] havoc main_#t~nondet5; [L26-L28] assume !(0 == main_~cond~0); [L29] main_~lk1~0 := 0; [L31] main_~lk2~0 := 0; [L33] main_~lk3~0 := 0; [L35] main_~lk4~0 := 0; [L37] main_~lk5~0 := 0; [L41-L43] assume !(0 != main_~p1~0); [L45-L47] assume !(0 != main_~p2~0); [L49-L51] assume !(0 != main_~p3~0); [L53-L55] assume !(0 != main_~p4~0); [L57-L59] assume !(0 != main_~p5~0); [L63-L66] assume !(0 != main_~p1~0); [L68-L71] assume !(0 != main_~p2~0); [L73-L76] assume !(0 != main_~p3~0); [L78-L81] assume !(0 != main_~p4~0); [L83-L86] assume !(0 != main_~p5~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L24-L88] assume !false; [L25] main_~cond~0 := main_#t~nondet5; [L25] havoc main_#t~nondet5; [L26-L28] assume !(0 == main_~cond~0); [L29] main_~lk1~0 := 0; [L31] main_~lk2~0 := 0; [L33] main_~lk3~0 := 0; [L35] main_~lk4~0 := 0; [L37] main_~lk5~0 := 0; [L41-L43] assume !(0 != main_~p1~0); [L45-L47] assume !(0 != main_~p2~0); [L49-L51] assume !(0 != main_~p3~0); [L53-L55] assume !(0 != main_~p4~0); [L57-L59] assume !(0 != main_~p5~0); [L63-L66] assume !(0 != main_~p1~0); [L68-L71] assume !(0 != main_~p2~0); [L73-L76] assume !(0 != main_~p3~0); [L78-L81] assume !(0 != main_~p4~0); [L83-L86] assume !(0 != main_~p5~0); [L24-L88] COND FALSE !(false) [L25] main_~cond~0 := main_#t~nondet5; [L25] havoc main_#t~nondet5; [L26] COND FALSE !(0 == main_~cond~0) [L29] main_~lk1~0 := 0; [L31] main_~lk2~0 := 0; [L33] main_~lk3~0 := 0; [L35] main_~lk4~0 := 0; [L37] main_~lk5~0 := 0; [L41] COND FALSE !(0 != main_~p1~0) [L45] COND FALSE !(0 != main_~p2~0) [L49] COND FALSE !(0 != main_~p3~0) [L53] COND FALSE !(0 != main_~p4~0) [L57] COND FALSE !(0 != main_~p5~0) [L63] COND FALSE !(0 != main_~p1~0) [L68] COND FALSE !(0 != main_~p2~0) [L73] COND FALSE !(0 != main_~p3~0) [L78] COND FALSE !(0 != main_~p4~0) [L83] COND FALSE !(0 != main_~p5~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L24-L88] COND FALSE !(false) [L25] main_~cond~0 := main_#t~nondet5; [L25] havoc main_#t~nondet5; [L26] COND FALSE !(0 == main_~cond~0) [L29] main_~lk1~0 := 0; [L31] main_~lk2~0 := 0; [L33] main_~lk3~0 := 0; [L35] main_~lk4~0 := 0; [L37] main_~lk5~0 := 0; [L41] COND FALSE !(0 != main_~p1~0) [L45] COND FALSE !(0 != main_~p2~0) [L49] COND FALSE !(0 != main_~p3~0) [L53] COND FALSE !(0 != main_~p4~0) [L57] COND FALSE !(0 != main_~p5~0) [L63] COND FALSE !(0 != main_~p1~0) [L68] COND FALSE !(0 != main_~p2~0) [L73] COND FALSE !(0 != main_~p3~0) [L78] COND FALSE !(0 != main_~p4~0) [L83] COND FALSE !(0 != main_~p5~0) [L24-L88] COND FALSE !(false) [L25] ~cond~0 := #t~nondet5; [L25] havoc #t~nondet5; [L26] COND FALSE !(0 == ~cond~0) [L29] ~lk1~0 := 0; [L31] ~lk2~0 := 0; [L33] ~lk3~0 := 0; [L35] ~lk4~0 := 0; [L37] ~lk5~0 := 0; [L41] COND FALSE !(0 != ~p1~0) [L45] COND FALSE !(0 != ~p2~0) [L49] COND FALSE !(0 != ~p3~0) [L53] COND FALSE !(0 != ~p4~0) [L57] COND FALSE !(0 != ~p5~0) [L63] COND FALSE !(0 != ~p1~0) [L68] COND FALSE !(0 != ~p2~0) [L73] COND FALSE !(0 != ~p3~0) [L78] COND FALSE !(0 != ~p4~0) [L83] COND FALSE !(0 != ~p5~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L24-L88] COND FALSE !(false) [L25] ~cond~0 := #t~nondet5; [L25] havoc #t~nondet5; [L26] COND FALSE !(0 == ~cond~0) [L29] ~lk1~0 := 0; [L31] ~lk2~0 := 0; [L33] ~lk3~0 := 0; [L35] ~lk4~0 := 0; [L37] ~lk5~0 := 0; [L41] COND FALSE !(0 != ~p1~0) [L45] COND FALSE !(0 != ~p2~0) [L49] COND FALSE !(0 != ~p3~0) [L53] COND FALSE !(0 != ~p4~0) [L57] COND FALSE !(0 != ~p5~0) [L63] COND FALSE !(0 != ~p1~0) [L68] COND FALSE !(0 != ~p2~0) [L73] COND FALSE !(0 != ~p3~0) [L78] COND FALSE !(0 != ~p4~0) [L83] COND FALSE !(0 != ~p5~0) [L24] COND TRUE 1 [L25] cond = __VERIFIER_nondet_int() [L26] COND FALSE !(cond == 0) [L29] lk1 = 0 [L31] lk2 = 0 [L33] lk3 = 0 [L35] lk4 = 0 [L37] lk5 = 0 [L41] COND FALSE !(p1 != 0) [L45] COND FALSE !(p2 != 0) [L49] COND FALSE !(p3 != 0) [L53] COND FALSE !(p4 != 0) [L57] COND FALSE !(p5 != 0) [L63] COND FALSE !(p1 != 0) [L68] COND FALSE !(p2 != 0) [L73] COND FALSE !(p3 != 0) [L78] COND FALSE !(p4 != 0) [L83] COND FALSE !(p5 != 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; [L22] int cond; Loop: [L24] COND TRUE 1 [L25] cond = __VERIFIER_nondet_int() [L26] COND FALSE !(cond == 0) [L29] lk1 = 0 [L31] lk2 = 0 [L33] lk3 = 0 [L35] lk4 = 0 [L37] lk5 = 0 [L41] COND FALSE !(p1 != 0) [L45] COND FALSE !(p2 != 0) [L49] COND FALSE !(p3 != 0) [L53] COND FALSE !(p4 != 0) [L57] COND FALSE !(p5 != 0) [L63] COND FALSE !(p1 != 0) [L68] COND FALSE !(p2 != 0) [L73] COND FALSE !(p3 != 0) [L78] COND FALSE !(p4 != 0) [L83] COND FALSE !(p5 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...