./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a960ce-f7a5-4389-96d4-2c6e387c7054/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a960ce-f7a5-4389-96d4-2c6e387c7054/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a960ce-f7a5-4389-96d4-2c6e387c7054/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a960ce-f7a5-4389-96d4-2c6e387c7054/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_5.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a960ce-f7a5-4389-96d4-2c6e387c7054/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a960ce-f7a5-4389-96d4-2c6e387c7054/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --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 3f68d39859f114df07f2619f37e3285dcdf00194e62a42552d2c67e537c13685 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:05:33,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:05:33,242 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a960ce-f7a5-4389-96d4-2c6e387c7054/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-13 16:05:33,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:05:33,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:05:33,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:05:33,292 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:05:33,292 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:05:33,292 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 16:05:33,292 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 16:05:33,295 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:05:33,296 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:05:33,296 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:05:33,296 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-13 16:05:33,297 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-13 16:05:33,297 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-13 16:05:33,297 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-13 16:05:33,297 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-13 16:05:33,297 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-13 16:05:33,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:05:33,297 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-13 16:05:33,297 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:05:33,297 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 16:05:33,297 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:05:33,298 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:05:33,298 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-13 16:05:33,298 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-13 16:05:33,298 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-13 16:05:33,298 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:05:33,298 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 16:05:33,298 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:05:33,298 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:05:33,298 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-13 16:05:33,298 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:05:33,298 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:05:33,298 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:05:33,299 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:05:33,299 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 16:05:33,299 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-13 16:05:33,299 INFO L153 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_worker_vcloud-master_on_vcloud-master/run_dir_f9a960ce-f7a5-4389-96d4-2c6e387c7054/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 3f68d39859f114df07f2619f37e3285dcdf00194e62a42552d2c67e537c13685 [2024-11-13 16:05:33,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:05:33,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:05:33,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:05:33,650 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:05:33,650 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:05:33,651 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a960ce-f7a5-4389-96d4-2c6e387c7054/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/locks/test_locks_5.c Unable to find full path for "g++" [2024-11-13 16:05:35,614 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:05:35,877 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:05:35,879 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a960ce-f7a5-4389-96d4-2c6e387c7054/sv-benchmarks/c/locks/test_locks_5.c [2024-11-13 16:05:35,903 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a960ce-f7a5-4389-96d4-2c6e387c7054/bin/uautomizer-verify-qhAvR1uOyd/data/831673565/1564701fba4741baabccd9014b34c3c2/FLAG67802b744 [2024-11-13 16:05:36,177 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a960ce-f7a5-4389-96d4-2c6e387c7054/bin/uautomizer-verify-qhAvR1uOyd/data/831673565/1564701fba4741baabccd9014b34c3c2 [2024-11-13 16:05:36,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:05:36,181 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:05:36,183 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:05:36,183 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:05:36,190 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:05:36,191 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:05:36" (1/1) ... [2024-11-13 16:05:36,192 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dba3de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:05:36, skipping insertion in model container [2024-11-13 16:05:36,192 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:05:36" (1/1) ... [2024-11-13 16:05:36,209 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:05:36,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:05:36,393 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:05:36,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:05:36,436 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:05:36,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:05:36 WrapperNode [2024-11-13 16:05:36,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:05:36,439 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:05:36,439 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:05:36,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:05:36,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:05:36" (1/1) ... [2024-11-13 16:05:36,455 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:05:36" (1/1) ... [2024-11-13 16:05:36,475 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2024-11-13 16:05:36,476 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:05:36,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:05:36,477 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:05:36,477 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:05:36,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:05:36" (1/1) ... [2024-11-13 16:05:36,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:05:36" (1/1) ... [2024-11-13 16:05:36,485 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:05:36" (1/1) ... [2024-11-13 16:05:36,495 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 16:05:36,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:05:36" (1/1) ... [2024-11-13 16:05:36,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:05:36" (1/1) ... [2024-11-13 16:05:36,499 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:05:36" (1/1) ... [2024-11-13 16:05:36,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:05:36" (1/1) ... [2024-11-13 16:05:36,504 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:05:36" (1/1) ... [2024-11-13 16:05:36,505 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:05:36" (1/1) ... [2024-11-13 16:05:36,506 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:05:36,507 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:05:36,507 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:05:36,507 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:05:36,508 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:05:36" (1/1) ... [2024-11-13 16:05:36,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:05:36,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a960ce-f7a5-4389-96d4-2c6e387c7054/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:05:36,541 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a960ce-f7a5-4389-96d4-2c6e387c7054/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:05:36,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a960ce-f7a5-4389-96d4-2c6e387c7054/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-13 16:05:36,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:05:36,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:05:36,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:05:36,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 16:05:36,650 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:05:36,652 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:05:36,823 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-13 16:05:36,823 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:05:36,832 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:05:36,833 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 16:05:36,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:05:36 BoogieIcfgContainer [2024-11-13 16:05:36,833 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:05:36,834 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-13 16:05:36,834 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-13 16:05:36,839 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-13 16:05:36,840 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 16:05:36,840 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.11 04:05:36" (1/3) ... [2024-11-13 16:05:36,842 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18c781e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 04:05:36, skipping insertion in model container [2024-11-13 16:05:36,842 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 16:05:36,842 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:05:36" (2/3) ... [2024-11-13 16:05:36,842 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18c781e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 04:05:36, skipping insertion in model container [2024-11-13 16:05:36,842 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 16:05:36,843 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:05:36" (3/3) ... [2024-11-13 16:05:36,845 INFO L333 chiAutomizerObserver]: Analyzing ICFG test_locks_5.c [2024-11-13 16:05:36,913 INFO L299 stractBuchiCegarLoop]: Interprodecural is true [2024-11-13 16:05:36,913 INFO L300 stractBuchiCegarLoop]: Hoare is None [2024-11-13 16:05:36,914 INFO L301 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-13 16:05:36,914 INFO L302 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-13 16:05:36,914 INFO L303 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-13 16:05:36,914 INFO L304 stractBuchiCegarLoop]: Difference is false [2024-11-13 16:05:36,914 INFO L305 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-13 16:05:36,914 INFO L309 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-13 16:05:36,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:05:36,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-11-13 16:05:36,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:05:36,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:05:36,942 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 16:05:36,942 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:05:36,943 INFO L331 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-13 16:05:36,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:05:36,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-11-13 16:05:36,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:05:36,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:05:36,945 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 16:05:36,946 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:05:36,953 INFO L745 eck$LassoCheckResult]: Stem: 24#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_~cond~0#1; 12#L85-1true [2024-11-13 16:05:36,954 INFO L747 eck$LassoCheckResult]: Loop: 12#L85-1true assume !false;havoc main_#t~nondet9#1;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 23#L28true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0; 13#L43true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 14#L43-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 19#L47-1true assume !(0 != main_~p3~0#1); 7#L51-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 8#L55-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 9#L59-1true assume !(0 != main_~p1~0#1); 15#L65-1true assume !(0 != main_~p2~0#1); 21#L70-1true assume !(0 != main_~p3~0#1); 22#L75-1true assume !(0 != main_~p4~0#1); 11#L80-1true assume !(0 != main_~p5~0#1); 12#L85-1true [2024-11-13 16:05:36,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:36,961 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-13 16:05:36,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:36,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593722855] [2024-11-13 16:05:36,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:36,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:05:37,061 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:05:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:05:37,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:05:37,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:37,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1077541325, now seen corresponding path program 1 times [2024-11-13 16:05:37,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:37,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130515486] [2024-11-13 16:05:37,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:37,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:37,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:05:37,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:05:37,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130515486] [2024-11-13 16:05:37,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130515486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:05:37,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:05:37,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:05:37,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615101068] [2024-11-13 16:05:37,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:05:37,222 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 16:05:37,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:05:37,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:05:37,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:05:37,258 INFO L87 Difference]: Start difference. First operand has 25 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:05:37,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:05:37,317 INFO L93 Difference]: Finished difference Result 43 states and 69 transitions. [2024-11-13 16:05:37,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 69 transitions. [2024-11-13 16:05:37,320 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2024-11-13 16:05:37,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 35 states and 53 transitions. [2024-11-13 16:05:37,334 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2024-11-13 16:05:37,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2024-11-13 16:05:37,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 53 transitions. [2024-11-13 16:05:37,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:05:37,337 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 53 transitions. [2024-11-13 16:05:37,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 53 transitions. [2024-11-13 16:05:37,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-13 16:05:37,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 34 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:05:37,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 53 transitions. [2024-11-13 16:05:37,376 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 53 transitions. [2024-11-13 16:05:37,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:05:37,383 INFO L424 stractBuchiCegarLoop]: Abstraction has 35 states and 53 transitions. [2024-11-13 16:05:37,384 INFO L331 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-13 16:05:37,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 53 transitions. [2024-11-13 16:05:37,385 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2024-11-13 16:05:37,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:05:37,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:05:37,385 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 16:05:37,385 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:05:37,386 INFO L745 eck$LassoCheckResult]: Stem: 102#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 91#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_~cond~0#1; 92#L85-1 [2024-11-13 16:05:37,386 INFO L747 eck$LassoCheckResult]: Loop: 92#L85-1 assume !false;havoc main_#t~nondet9#1;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 100#L28 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0; 101#L43 assume !(0 != main_~p1~0#1); 84#L43-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 85#L47-1 assume !(0 != main_~p3~0#1); 93#L51-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 94#L55-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 95#L59-1 assume !(0 != main_~p1~0#1); 86#L65-1 assume !(0 != main_~p2~0#1); 87#L70-1 assume !(0 != main_~p3~0#1); 97#L75-1 assume !(0 != main_~p4~0#1); 107#L80-1 assume !(0 != main_~p5~0#1); 92#L85-1 [2024-11-13 16:05:37,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:37,390 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-13 16:05:37,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:37,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661051298] [2024-11-13 16:05:37,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:37,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:05:37,402 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:05:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:05:37,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:05:37,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:37,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1470568335, now seen corresponding path program 1 times [2024-11-13 16:05:37,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:37,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050882456] [2024-11-13 16:05:37,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:37,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:37,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:05:37,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:05:37,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050882456] [2024-11-13 16:05:37,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050882456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:05:37,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:05:37,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:05:37,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806782579] [2024-11-13 16:05:37,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:05:37,485 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 16:05:37,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:05:37,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:05:37,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:05:37,486 INFO L87 Difference]: Start difference. First operand 35 states and 53 transitions. cyclomatic complexity: 20 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:05:37,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:05:37,530 INFO L93 Difference]: Finished difference Result 66 states and 98 transitions. [2024-11-13 16:05:37,531 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 98 transitions. [2024-11-13 16:05:37,532 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 64 [2024-11-13 16:05:37,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 98 transitions. [2024-11-13 16:05:37,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2024-11-13 16:05:37,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2024-11-13 16:05:37,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 98 transitions. [2024-11-13 16:05:37,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:05:37,538 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 98 transitions. [2024-11-13 16:05:37,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 98 transitions. [2024-11-13 16:05:37,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-13 16:05:37,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 65 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:05:37,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2024-11-13 16:05:37,547 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 98 transitions. [2024-11-13 16:05:37,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:05:37,548 INFO L424 stractBuchiCegarLoop]: Abstraction has 66 states and 98 transitions. [2024-11-13 16:05:37,548 INFO L331 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-13 16:05:37,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 98 transitions. [2024-11-13 16:05:37,549 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 64 [2024-11-13 16:05:37,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:05:37,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:05:37,550 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 16:05:37,550 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:05:37,550 INFO L745 eck$LassoCheckResult]: Stem: 209#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 198#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_~cond~0#1; 199#L85-1 [2024-11-13 16:05:37,550 INFO L747 eck$LassoCheckResult]: Loop: 199#L85-1 assume !false;havoc main_#t~nondet9#1;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 226#L28 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0; 224#L43 assume !(0 != main_~p1~0#1); 221#L43-2 assume !(0 != main_~p2~0#1); 220#L47-1 assume !(0 != main_~p3~0#1); 218#L51-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 216#L55-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 215#L59-1 assume !(0 != main_~p1~0#1); 210#L65-1 assume !(0 != main_~p2~0#1); 211#L70-1 assume !(0 != main_~p3~0#1); 235#L75-1 assume !(0 != main_~p4~0#1); 231#L80-1 assume !(0 != main_~p5~0#1); 199#L85-1 [2024-11-13 16:05:37,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:37,551 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-13 16:05:37,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:37,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719389513] [2024-11-13 16:05:37,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:37,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:05:37,558 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:05:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:05:37,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:05:37,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:37,571 INFO L85 PathProgramCache]: Analyzing trace with hash -790509965, now seen corresponding path program 1 times [2024-11-13 16:05:37,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:37,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440438284] [2024-11-13 16:05:37,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:37,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:37,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:05:37,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:05:37,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440438284] [2024-11-13 16:05:37,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440438284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:05:37,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:05:37,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:05:37,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247550182] [2024-11-13 16:05:37,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:05:37,634 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 16:05:37,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:05:37,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:05:37,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:05:37,635 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. cyclomatic complexity: 36 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:05:37,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:05:37,662 INFO L93 Difference]: Finished difference Result 126 states and 182 transitions. [2024-11-13 16:05:37,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 182 transitions. [2024-11-13 16:05:37,665 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 124 [2024-11-13 16:05:37,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 182 transitions. [2024-11-13 16:05:37,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2024-11-13 16:05:37,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2024-11-13 16:05:37,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 182 transitions. [2024-11-13 16:05:37,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:05:37,668 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 182 transitions. [2024-11-13 16:05:37,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 182 transitions. [2024-11-13 16:05:37,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-13 16:05:37,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.4444444444444444) internal successors, (182), 125 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:05:37,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 182 transitions. [2024-11-13 16:05:37,679 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 182 transitions. [2024-11-13 16:05:37,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:05:37,681 INFO L424 stractBuchiCegarLoop]: Abstraction has 126 states and 182 transitions. [2024-11-13 16:05:37,681 INFO L331 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-13 16:05:37,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 182 transitions. [2024-11-13 16:05:37,683 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 124 [2024-11-13 16:05:37,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:05:37,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:05:37,684 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 16:05:37,684 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:05:37,684 INFO L745 eck$LassoCheckResult]: Stem: 408#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 395#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_~cond~0#1; 396#L85-1 [2024-11-13 16:05:37,684 INFO L747 eck$LassoCheckResult]: Loop: 396#L85-1 assume !false;havoc main_#t~nondet9#1;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 445#L28 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0; 442#L43 assume !(0 != main_~p1~0#1); 438#L43-2 assume !(0 != main_~p2~0#1); 436#L47-1 assume !(0 != main_~p3~0#1); 422#L51-1 assume !(0 != main_~p4~0#1); 423#L55-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 463#L59-1 assume !(0 != main_~p1~0#1); 461#L65-1 assume !(0 != main_~p2~0#1); 460#L70-1 assume !(0 != main_~p3~0#1); 454#L75-1 assume !(0 != main_~p4~0#1); 451#L80-1 assume !(0 != main_~p5~0#1); 396#L85-1 [2024-11-13 16:05:37,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:37,685 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-13 16:05:37,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:37,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019238075] [2024-11-13 16:05:37,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:37,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:05:37,692 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:05:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:05:37,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:05:37,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:37,699 INFO L85 PathProgramCache]: Analyzing trace with hash 984497397, now seen corresponding path program 1 times [2024-11-13 16:05:37,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:37,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312768847] [2024-11-13 16:05:37,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:37,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:37,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:05:37,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:05:37,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312768847] [2024-11-13 16:05:37,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312768847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:05:37,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:05:37,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:05:37,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984567414] [2024-11-13 16:05:37,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:05:37,733 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 16:05:37,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:05:37,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:05:37,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:05:37,734 INFO L87 Difference]: Start difference. First operand 126 states and 182 transitions. cyclomatic complexity: 64 Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:05:37,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:05:37,784 INFO L93 Difference]: Finished difference Result 242 states and 338 transitions. [2024-11-13 16:05:37,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 242 states and 338 transitions. [2024-11-13 16:05:37,792 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 240 [2024-11-13 16:05:37,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 242 states to 242 states and 338 transitions. [2024-11-13 16:05:37,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2024-11-13 16:05:37,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2024-11-13 16:05:37,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 242 states and 338 transitions. [2024-11-13 16:05:37,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:05:37,800 INFO L218 hiAutomatonCegarLoop]: Abstraction has 242 states and 338 transitions. [2024-11-13 16:05:37,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states and 338 transitions. [2024-11-13 16:05:37,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2024-11-13 16:05:37,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 242 states have (on average 1.396694214876033) internal successors, (338), 241 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:05:37,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 338 transitions. [2024-11-13 16:05:37,832 INFO L240 hiAutomatonCegarLoop]: Abstraction has 242 states and 338 transitions. [2024-11-13 16:05:37,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:05:37,833 INFO L424 stractBuchiCegarLoop]: Abstraction has 242 states and 338 transitions. [2024-11-13 16:05:37,834 INFO L331 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-13 16:05:37,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 242 states and 338 transitions. [2024-11-13 16:05:37,836 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 240 [2024-11-13 16:05:37,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:05:37,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:05:37,840 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 16:05:37,840 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:05:37,840 INFO L745 eck$LassoCheckResult]: Stem: 782#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 769#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_~cond~0#1; 770#L85-1 [2024-11-13 16:05:37,840 INFO L747 eck$LassoCheckResult]: Loop: 770#L85-1 assume !false;havoc main_#t~nondet9#1;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 810#L28 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0; 805#L43 assume !(0 != main_~p1~0#1); 806#L43-2 assume !(0 != main_~p2~0#1); 848#L47-1 assume !(0 != main_~p3~0#1); 844#L51-1 assume !(0 != main_~p4~0#1); 840#L55-1 assume !(0 != main_~p5~0#1); 838#L59-1 assume !(0 != main_~p1~0#1); 835#L65-1 assume !(0 != main_~p2~0#1); 832#L70-1 assume !(0 != main_~p3~0#1); 825#L75-1 assume !(0 != main_~p4~0#1); 819#L80-1 assume !(0 != main_~p5~0#1); 770#L85-1 [2024-11-13 16:05:37,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:37,841 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-11-13 16:05:37,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:37,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294014071] [2024-11-13 16:05:37,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:37,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:05:37,847 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:05:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:05:37,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:05:37,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:37,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1041755699, now seen corresponding path program 1 times [2024-11-13 16:05:37,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:37,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122917909] [2024-11-13 16:05:37,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:37,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:05:37,857 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:05:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:05:37,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:05:37,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:05:37,863 INFO L85 PathProgramCache]: Analyzing trace with hash -2039062795, now seen corresponding path program 1 times [2024-11-13 16:05:37,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:05:37,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35160663] [2024-11-13 16:05:37,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:05:37,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:05:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:05:37,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:05:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:05:37,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:05:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:05:38,300 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:05:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:05:38,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.11 04:05:38 BoogieIcfgContainer [2024-11-13 16:05:38,342 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-13 16:05:38,343 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 16:05:38,346 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 16:05:38,347 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 16:05:38,347 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:05:36" (3/4) ... [2024-11-13 16:05:38,349 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-13 16:05:38,375 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a960ce-f7a5-4389-96d4-2c6e387c7054/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 16:05:38,376 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 16:05:38,377 INFO L158 Benchmark]: Toolchain (without parser) took 2195.22ms. Allocated memory is still 117.4MB. Free memory was 93.6MB in the beginning and 62.9MB in the end (delta: 30.7MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2024-11-13 16:05:38,380 INFO L158 Benchmark]: CDTParser took 0.99ms. Allocated memory is still 167.8MB. Free memory is still 104.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:05:38,380 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.84ms. Allocated memory is still 117.4MB. Free memory was 93.6MB in the beginning and 82.8MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:05:38,380 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.19ms. Allocated memory is still 117.4MB. Free memory was 82.8MB in the beginning and 81.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:05:38,381 INFO L158 Benchmark]: Boogie Preprocessor took 30.03ms. Allocated memory is still 117.4MB. Free memory was 81.7MB in the beginning and 80.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:05:38,381 INFO L158 Benchmark]: RCFGBuilder took 326.31ms. Allocated memory is still 117.4MB. Free memory was 80.3MB in the beginning and 69.4MB in the end (delta: 10.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 16:05:38,381 INFO L158 Benchmark]: BuchiAutomizer took 1508.37ms. Allocated memory is still 117.4MB. Free memory was 69.4MB in the beginning and 64.7MB in the end (delta: 4.7MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2024-11-13 16:05:38,382 INFO L158 Benchmark]: Witness Printer took 32.66ms. Allocated memory is still 117.4MB. Free memory was 64.7MB in the beginning and 62.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:05:38,385 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.99ms. Allocated memory is still 167.8MB. Free memory is still 104.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.84ms. Allocated memory is still 117.4MB. Free memory was 93.6MB in the beginning and 82.8MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.19ms. Allocated memory is still 117.4MB. Free memory was 82.8MB in the beginning and 81.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.03ms. Allocated memory is still 117.4MB. Free memory was 81.7MB in the beginning and 80.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 326.31ms. Allocated memory is still 117.4MB. Free memory was 80.3MB in the beginning and 69.4MB in the end (delta: 10.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 1508.37ms. Allocated memory is still 117.4MB. Free memory was 69.4MB in the beginning and 64.7MB in the end (delta: 4.7MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * Witness Printer took 32.66ms. Allocated memory is still 117.4MB. Free memory was 64.7MB in the beginning and 62.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * 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 242 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.4s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 87 mSDsluCounter, 275 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 99 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 176 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown 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 InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 26]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L24] int cond; Loop: [L26] COND TRUE 1 [L27] cond = __VERIFIER_nondet_int() [L28] COND FALSE !(cond == 0) [L31] lk1 = 0 [L33] lk2 = 0 [L35] lk3 = 0 [L37] lk4 = 0 [L39] lk5 = 0 [L43] COND FALSE !(p1 != 0) [L47] COND FALSE !(p2 != 0) [L51] COND FALSE !(p3 != 0) [L55] COND FALSE !(p4 != 0) [L59] COND FALSE !(p5 != 0) [L65] COND FALSE !(p1 != 0) [L70] COND FALSE !(p2 != 0) [L75] COND FALSE !(p3 != 0) [L80] COND FALSE !(p4 != 0) [L85] COND FALSE !(p5 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 26]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L24] int cond; Loop: [L26] COND TRUE 1 [L27] cond = __VERIFIER_nondet_int() [L28] COND FALSE !(cond == 0) [L31] lk1 = 0 [L33] lk2 = 0 [L35] lk3 = 0 [L37] lk4 = 0 [L39] lk5 = 0 [L43] COND FALSE !(p1 != 0) [L47] COND FALSE !(p2 != 0) [L51] COND FALSE !(p3 != 0) [L55] COND FALSE !(p4 != 0) [L59] COND FALSE !(p5 != 0) [L65] COND FALSE !(p1 != 0) [L70] COND FALSE !(p2 != 0) [L75] COND FALSE !(p3 != 0) [L80] COND FALSE !(p4 != 0) [L85] COND FALSE !(p5 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 16:05:38,411 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f9a960ce-f7a5-4389-96d4-2c6e387c7054/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)