./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/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 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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.24-0ed9222-m [2019-01-14 02:54:53,431 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:54:53,433 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:54:53,445 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:54:53,445 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:54:53,447 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:54:53,450 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:54:53,453 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:54:53,455 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:54:53,456 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:54:53,457 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:54:53,457 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:54:53,459 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:54:53,462 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:54:53,469 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:54:53,471 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:54:53,474 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:54:53,475 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:54:53,481 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:54:53,483 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:54:53,485 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:54:53,486 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:54:53,490 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:54:53,490 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:54:53,491 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:54:53,493 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:54:53,493 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:54:53,494 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:54:53,495 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:54:53,496 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:54:53,496 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:54:53,497 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:54:53,497 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:54:53,497 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:54:53,498 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:54:53,499 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:54:53,500 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 02:54:53,529 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:54:53,530 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:54:53,534 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:54:53,535 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:54:53,535 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:54:53,535 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:54:53,535 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:54:53,536 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:54:53,536 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:54:53,536 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:54:53,536 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:54:53,536 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:54:53,537 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 02:54:53,537 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:54:53,537 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:54:53,538 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 02:54:53,538 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:54:53,538 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:54:53,539 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:54:53,539 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:54:53,539 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 02:54:53,539 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:54:53,539 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:54:53,539 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:54:53,540 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:54:53,541 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:54:53,541 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:54:53,541 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:54:53,541 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:54:53,542 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:54:53,542 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:54:53,544 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:54:53,544 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f33d015f37d4475f0ca85a8ea6311ffc3e89abb [2019-01-14 02:54:53,583 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:54:53,595 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:54:53,598 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:54:53,599 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:54:53,600 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:54:53,603 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 02:54:53,660 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/218e24f38/8a5a86bebbeb448ba02da6ab0af9c090/FLAG397bedf93 [2019-01-14 02:54:54,096 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:54:54,098 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 02:54:54,106 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/218e24f38/8a5a86bebbeb448ba02da6ab0af9c090/FLAG397bedf93 [2019-01-14 02:54:54,439 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/218e24f38/8a5a86bebbeb448ba02da6ab0af9c090 [2019-01-14 02:54:54,443 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:54:54,444 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:54:54,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:54:54,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:54:54,449 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:54:54,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:54:54" (1/1) ... [2019-01-14 02:54:54,455 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f25dd8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:54, skipping insertion in model container [2019-01-14 02:54:54,456 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:54:54" (1/1) ... [2019-01-14 02:54:54,464 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:54:54,485 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:54:54,708 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:54:54,718 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:54:54,747 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:54:54,765 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:54:54,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:54 WrapperNode [2019-01-14 02:54:54,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:54:54,767 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:54:54,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:54:54,768 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:54:54,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:54" (1/1) ... [2019-01-14 02:54:54,784 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:54" (1/1) ... [2019-01-14 02:54:54,810 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:54:54,812 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:54:54,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:54:54,813 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:54:54,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:54" (1/1) ... [2019-01-14 02:54:54,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:54" (1/1) ... [2019-01-14 02:54:54,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:54" (1/1) ... [2019-01-14 02:54:54,826 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:54" (1/1) ... [2019-01-14 02:54:54,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:54" (1/1) ... [2019-01-14 02:54:54,836 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:54" (1/1) ... [2019-01-14 02:54:54,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:54" (1/1) ... [2019-01-14 02:54:54,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:54:54,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:54:54,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:54:54,839 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:54:54,841 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:54:54,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:54:54,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:54:55,328 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:54:55,329 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 02:54:55,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:54:55 BoogieIcfgContainer [2019-01-14 02:54:55,330 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:54:55,331 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:54:55,332 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:54:55,335 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:54:55,335 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:54:55,335 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:54:54" (1/3) ... [2019-01-14 02:54:55,337 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c1e81f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:54:55, skipping insertion in model container [2019-01-14 02:54:55,337 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:54:55,337 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:54:54" (2/3) ... [2019-01-14 02:54:55,337 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c1e81f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:54:55, skipping insertion in model container [2019-01-14 02:54:55,337 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:54:55,338 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:54:55" (3/3) ... [2019-01-14 02:54:55,339 INFO L375 chiAutomizerObserver]: Analyzing ICFG test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 02:54:55,397 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:54:55,398 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:54:55,398 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:54:55,398 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:54:55,398 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:54:55,399 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:54:55,399 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:54:55,399 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:54:55,399 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:54:55,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2019-01-14 02:54:55,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-01-14 02:54:55,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:54:55,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:54:55,445 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:54:55,446 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:54:55,446 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:54:55,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2019-01-14 02:54:55,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-01-14 02:54:55,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:54:55,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:54:55,450 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:54:55,450 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:54:55,456 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 [2019-01-14 02:54:55,457 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 [2019-01-14 02:54:55,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:55,463 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-14 02:54:55,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:55,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:55,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:55,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:55,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:55,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:55,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1077541325, now seen corresponding path program 1 times [2019-01-14 02:54:55,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:55,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:55,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:55,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:55,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:54:55,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:54:55,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:54:55,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:54:55,617 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:54:55,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:54:55,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:54:55,637 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-01-14 02:54:55,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:54:55,730 INFO L93 Difference]: Finished difference Result 44 states and 69 transitions. [2019-01-14 02:54:55,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:54:55,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 69 transitions. [2019-01-14 02:54:55,736 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2019-01-14 02:54:55,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 34 states and 52 transitions. [2019-01-14 02:54:55,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-01-14 02:54:55,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-01-14 02:54:55,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 52 transitions. [2019-01-14 02:54:55,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:54:55,743 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 52 transitions. [2019-01-14 02:54:55,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 52 transitions. [2019-01-14 02:54:55,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-14 02:54:55,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-14 02:54:55,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 52 transitions. [2019-01-14 02:54:55,774 INFO L729 BuchiCegarLoop]: Abstraction has 34 states and 52 transitions. [2019-01-14 02:54:55,774 INFO L609 BuchiCegarLoop]: Abstraction has 34 states and 52 transitions. [2019-01-14 02:54:55,774 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:54:55,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 52 transitions. [2019-01-14 02:54:55,776 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2019-01-14 02:54:55,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:54:55,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:54:55,777 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:54:55,777 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:54:55,777 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 [2019-01-14 02:54:55,777 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 [2019-01-14 02:54:55,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:55,778 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-01-14 02:54:55,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:55,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:55,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:55,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:55,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:55,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:55,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1470568335, now seen corresponding path program 1 times [2019-01-14 02:54:55,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:55,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:55,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:55,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:54:55,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:54:55,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:54:55,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:54:55,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:54:55,824 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:54:55,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:54:55,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:54:55,825 INFO L87 Difference]: Start difference. First operand 34 states and 52 transitions. cyclomatic complexity: 20 Second operand 3 states. [2019-01-14 02:54:55,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:54:55,864 INFO L93 Difference]: Finished difference Result 65 states and 97 transitions. [2019-01-14 02:54:55,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:54:55,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 97 transitions. [2019-01-14 02:54:55,868 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 64 [2019-01-14 02:54:55,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 97 transitions. [2019-01-14 02:54:55,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2019-01-14 02:54:55,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2019-01-14 02:54:55,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 97 transitions. [2019-01-14 02:54:55,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:54:55,871 INFO L706 BuchiCegarLoop]: Abstraction has 65 states and 97 transitions. [2019-01-14 02:54:55,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 97 transitions. [2019-01-14 02:54:55,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-14 02:54:55,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-14 02:54:55,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 97 transitions. [2019-01-14 02:54:55,879 INFO L729 BuchiCegarLoop]: Abstraction has 65 states and 97 transitions. [2019-01-14 02:54:55,879 INFO L609 BuchiCegarLoop]: Abstraction has 65 states and 97 transitions. [2019-01-14 02:54:55,879 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:54:55,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 97 transitions. [2019-01-14 02:54:55,881 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 64 [2019-01-14 02:54:55,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:54:55,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:54:55,882 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:54:55,882 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:54:55,882 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 [2019-01-14 02:54:55,883 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 [2019-01-14 02:54:55,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:55,883 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-01-14 02:54:55,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:55,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:55,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:55,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:55,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:55,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:55,892 INFO L82 PathProgramCache]: Analyzing trace with hash -790509965, now seen corresponding path program 1 times [2019-01-14 02:54:55,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:55,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:55,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:55,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:54:55,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:54:55,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:54:55,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:54:55,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:54:55,958 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:54:55,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:54:55,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:54:55,959 INFO L87 Difference]: Start difference. First operand 65 states and 97 transitions. cyclomatic complexity: 36 Second operand 3 states. [2019-01-14 02:54:56,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:54:56,010 INFO L93 Difference]: Finished difference Result 125 states and 181 transitions. [2019-01-14 02:54:56,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:54:56,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 181 transitions. [2019-01-14 02:54:56,014 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 124 [2019-01-14 02:54:56,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 181 transitions. [2019-01-14 02:54:56,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2019-01-14 02:54:56,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2019-01-14 02:54:56,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 181 transitions. [2019-01-14 02:54:56,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:54:56,019 INFO L706 BuchiCegarLoop]: Abstraction has 125 states and 181 transitions. [2019-01-14 02:54:56,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 181 transitions. [2019-01-14 02:54:56,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-01-14 02:54:56,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-14 02:54:56,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 181 transitions. [2019-01-14 02:54:56,032 INFO L729 BuchiCegarLoop]: Abstraction has 125 states and 181 transitions. [2019-01-14 02:54:56,032 INFO L609 BuchiCegarLoop]: Abstraction has 125 states and 181 transitions. [2019-01-14 02:54:56,032 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:54:56,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 181 transitions. [2019-01-14 02:54:56,035 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 124 [2019-01-14 02:54:56,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:54:56,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:54:56,035 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:54:56,036 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:54:56,036 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 [2019-01-14 02:54:56,037 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 [2019-01-14 02:54:56,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:56,037 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-01-14 02:54:56,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:56,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:56,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:56,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:56,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:56,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:56,048 INFO L82 PathProgramCache]: Analyzing trace with hash 984497397, now seen corresponding path program 1 times [2019-01-14 02:54:56,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:56,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:56,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:56,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:54:56,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:54:56,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:54:56,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:54:56,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:54:56,081 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:54:56,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:54:56,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:54:56,082 INFO L87 Difference]: Start difference. First operand 125 states and 181 transitions. cyclomatic complexity: 64 Second operand 3 states. [2019-01-14 02:54:56,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:54:56,117 INFO L93 Difference]: Finished difference Result 241 states and 337 transitions. [2019-01-14 02:54:56,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:54:56,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 241 states and 337 transitions. [2019-01-14 02:54:56,121 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 240 [2019-01-14 02:54:56,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 241 states to 241 states and 337 transitions. [2019-01-14 02:54:56,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 241 [2019-01-14 02:54:56,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 241 [2019-01-14 02:54:56,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 241 states and 337 transitions. [2019-01-14 02:54:56,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:54:56,132 INFO L706 BuchiCegarLoop]: Abstraction has 241 states and 337 transitions. [2019-01-14 02:54:56,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states and 337 transitions. [2019-01-14 02:54:56,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-01-14 02:54:56,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-14 02:54:56,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 337 transitions. [2019-01-14 02:54:56,156 INFO L729 BuchiCegarLoop]: Abstraction has 241 states and 337 transitions. [2019-01-14 02:54:56,157 INFO L609 BuchiCegarLoop]: Abstraction has 241 states and 337 transitions. [2019-01-14 02:54:56,157 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:54:56,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 241 states and 337 transitions. [2019-01-14 02:54:56,160 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 240 [2019-01-14 02:54:56,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:54:56,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:54:56,162 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:54:56,162 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:54:56,163 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 [2019-01-14 02:54:56,163 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 [2019-01-14 02:54:56,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:56,163 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-01-14 02:54:56,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:56,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:56,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:56,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:56,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:56,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:56,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1041755699, now seen corresponding path program 1 times [2019-01-14 02:54:56,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:56,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:56,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:56,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:54:56,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:56,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:54:56,218 INFO L82 PathProgramCache]: Analyzing trace with hash 536197074, now seen corresponding path program 1 times [2019-01-14 02:54:56,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:54:56,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:54:56,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:56,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:54:56,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:54:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:54:56,479 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-14 02:54:56,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:54:56 BoogieIcfgContainer [2019-01-14 02:54:56,644 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:54:56,644 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:54:56,644 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:54:56,645 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:54:56,645 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:54:55" (3/4) ... [2019-01-14 02:54:56,649 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 02:54:56,709 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 02:54:56,709 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:54:56,710 INFO L168 Benchmark]: Toolchain (without parser) took 2266.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 950.0 MB in the beginning and 1.0 GB in the end (delta: -63.7 MB). Peak memory consumption was 40.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:54:56,711 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:54:56,712 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.21 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:54:56,713 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.78 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:54:56,713 INFO L168 Benchmark]: Boogie Preprocessor took 26.36 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:54:56,714 INFO L168 Benchmark]: RCFGBuilder took 491.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -146.4 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:54:56,715 INFO L168 Benchmark]: BuchiAutomizer took 1312.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.9 MB). Peak memory consumption was 59.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:54:56,715 INFO L168 Benchmark]: Witness Printer took 65.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:54:56,720 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 321.21 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 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 44.78 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.36 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 491.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -146.4 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1312.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.9 MB). Peak memory consumption was 59.9 MB. Max. memory is 11.5 GB. * Witness Printer took 65.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 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 1.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 0.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 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.1s 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@5e871b5a=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1b873b6e=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@19de3285=1, lk5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4831ae9a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@a51115a=0, lk1=0, lk2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@42ebc222=0, cond=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 24]: Nonterminating execution 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...