./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b27c8e25-41a2-4925-9bfc-8014977ed80e/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b27c8e25-41a2-4925-9bfc-8014977ed80e/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b27c8e25-41a2-4925-9bfc-8014977ed80e/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b27c8e25-41a2-4925-9bfc-8014977ed80e/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b27c8e25-41a2-4925-9bfc-8014977ed80e/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b27c8e25-41a2-4925-9bfc-8014977ed80e/bin/uautomizer-verify-aQ6SnzHsRB --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 d852cbbb6aa933b5bfc297e03d0d3456bac2eafa50ad19971e71951b44cb15d3 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:38:24,300 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:38:24,427 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b27c8e25-41a2-4925-9bfc-8014977ed80e/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-28 02:38:24,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:38:24,434 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:38:24,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:38:24,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:38:24,497 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:38:24,498 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:38:24,498 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:38:24,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:38:24,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:38:24,499 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:38:24,499 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-28 02:38:24,499 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-28 02:38:24,499 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-28 02:38:24,501 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-28 02:38:24,501 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-28 02:38:24,501 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-28 02:38:24,502 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:38:24,502 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-28 02:38:24,502 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:38:24,503 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:38:24,503 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:38:24,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:38:24,503 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-28 02:38:24,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-28 02:38:24,503 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-28 02:38:24,503 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 02:38:24,503 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:38:24,503 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 02:38:24,504 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-28 02:38:24,504 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:38:24,504 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:38:24,504 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:38:24,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:38:24,504 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:38:24,504 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL_NO_AM [2024-11-28 02:38:24,505 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-28 02:38:24,505 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_b27c8e25-41a2-4925-9bfc-8014977ed80e/bin/uautomizer-verify-aQ6SnzHsRB 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 -> d852cbbb6aa933b5bfc297e03d0d3456bac2eafa50ad19971e71951b44cb15d3 [2024-11-28 02:38:24,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:38:24,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:38:24,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:38:24,990 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:38:24,991 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:38:24,993 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b27c8e25-41a2-4925-9bfc-8014977ed80e/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2024-11-28 02:38:28,813 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b27c8e25-41a2-4925-9bfc-8014977ed80e/bin/uautomizer-verify-aQ6SnzHsRB/data/bd7689270/b3d6a8a241654cc09aa2de162daf4e79/FLAG862900339 [2024-11-28 02:38:29,270 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:38:29,271 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b27c8e25-41a2-4925-9bfc-8014977ed80e/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2024-11-28 02:38:29,290 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b27c8e25-41a2-4925-9bfc-8014977ed80e/bin/uautomizer-verify-aQ6SnzHsRB/data/bd7689270/b3d6a8a241654cc09aa2de162daf4e79/FLAG862900339 [2024-11-28 02:38:29,324 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b27c8e25-41a2-4925-9bfc-8014977ed80e/bin/uautomizer-verify-aQ6SnzHsRB/data/bd7689270/b3d6a8a241654cc09aa2de162daf4e79 [2024-11-28 02:38:29,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:38:29,331 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:38:29,332 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:38:29,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:38:29,340 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:38:29,341 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:38:29" (1/1) ... [2024-11-28 02:38:29,344 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58ea965a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:29, skipping insertion in model container [2024-11-28 02:38:29,344 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:38:29" (1/1) ... [2024-11-28 02:38:29,383 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:38:29,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:38:29,708 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:38:29,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:38:29,758 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:38:29,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:29 WrapperNode [2024-11-28 02:38:29,759 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:38:29,759 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:38:29,760 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:38:29,760 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:38:29,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:29" (1/1) ... [2024-11-28 02:38:29,772 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:29" (1/1) ... [2024-11-28 02:38:29,808 INFO L138 Inliner]: procedures = 21, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 211 [2024-11-28 02:38:29,808 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:38:29,809 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:38:29,809 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:38:29,809 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:38:29,821 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:29" (1/1) ... [2024-11-28 02:38:29,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:29" (1/1) ... [2024-11-28 02:38:29,824 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:29" (1/1) ... [2024-11-28 02:38:29,842 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-28 02:38:29,843 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:29" (1/1) ... [2024-11-28 02:38:29,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:29" (1/1) ... [2024-11-28 02:38:29,849 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:29" (1/1) ... [2024-11-28 02:38:29,850 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:29" (1/1) ... [2024-11-28 02:38:29,855 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:29" (1/1) ... [2024-11-28 02:38:29,857 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:29" (1/1) ... [2024-11-28 02:38:29,858 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:29" (1/1) ... [2024-11-28 02:38:29,861 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:38:29,862 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:38:29,862 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:38:29,862 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:38:29,863 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:29" (1/1) ... [2024-11-28 02:38:29,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 02:38:29,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b27c8e25-41a2-4925-9bfc-8014977ed80e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:38:29,908 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b27c8e25-41a2-4925-9bfc-8014977ed80e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-28 02:38:29,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b27c8e25-41a2-4925-9bfc-8014977ed80e/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-28 02:38:29,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:38:29,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 02:38:29,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:38:29,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:38:30,024 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:38:30,027 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:38:30,537 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-28 02:38:30,538 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:38:30,559 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:38:30,559 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-28 02:38:30,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:38:30 BoogieIcfgContainer [2024-11-28 02:38:30,559 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:38:30,561 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-28 02:38:30,561 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-28 02:38:30,568 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-28 02:38:30,569 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-28 02:38:30,569 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 02:38:29" (1/3) ... [2024-11-28 02:38:30,571 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4fb0eeb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 02:38:30, skipping insertion in model container [2024-11-28 02:38:30,571 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-28 02:38:30,571 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:38:29" (2/3) ... [2024-11-28 02:38:30,571 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4fb0eeb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 02:38:30, skipping insertion in model container [2024-11-28 02:38:30,571 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-28 02:38:30,572 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:38:30" (3/3) ... [2024-11-28 02:38:30,573 INFO L363 chiAutomizerObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2024-11-28 02:38:30,652 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-28 02:38:30,653 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-28 02:38:30,653 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-28 02:38:30,653 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-28 02:38:30,653 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-28 02:38:30,654 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-28 02:38:30,654 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-28 02:38:30,655 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-28 02:38:30,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 57 states, 56 states have (on average 1.6607142857142858) internal successors, (93), 56 states have internal predecessors, (93), 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-28 02:38:30,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2024-11-28 02:38:30,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 02:38:30,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 02:38:30,699 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:38:30,700 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:38:30,700 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-28 02:38:30,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 57 states, 56 states have (on average 1.6607142857142858) internal successors, (93), 56 states have internal predecessors, (93), 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-28 02:38:30,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2024-11-28 02:38:30,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 02:38:30,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 02:38:30,707 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:38:30,707 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:38:30,717 INFO L747 eck$LassoCheckResult]: Stem: "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(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;" "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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~ret17#1, main_#t~ret18#1, main_#t~post19#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~mode1~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume 0 == main_#t~nondet12#1 || 1 == main_#t~nondet12#1;~mode2~0 := (if 0 == main_#t~nondet12#1 % 256 then 0 else 1);havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode3~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1;" "assume !(0 == ~r1~0);init_~tmp~0#1 := 0;" "init_#res#1 := init_~tmp~0#1;" "main_#t~ret17#1 := init_#res#1;havoc init_~tmp~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret17#1;havoc main_#t~ret17#1;" "assume !(0 == main_~i2~0#1);" "~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2024-11-28 02:38:30,721 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~i2~0#1 < 6;" "assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0;" "assume !(0 != ~mode1~0 % 256);~p1_new~0 := (if (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 <= 127 then (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 else (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 - 256);~mode1~0 := 1;" "havoc node1_~m1~0#1;assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0;" "assume !(0 != ~mode2~0 % 256);~p2_new~0 := (if (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 <= 127 then (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 else (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 - 256);~mode2~0 := 1;" "havoc node2_~m2~0#1;assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0;" "assume !(0 != ~mode3~0 % 256);~p3_new~0 := (if (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 <= 127 then (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 else (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 - 256);~mode3~0 := 1;" "havoc node3_~m3~0#1;assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1;" "assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret18#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret18#1;havoc main_#t~ret18#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post19#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" [2024-11-28 02:38:30,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:38:30,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1892699938, now seen corresponding path program 1 times [2024-11-28 02:38:30,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 02:38:30,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710576381] [2024-11-28 02:38:30,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:30,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:38:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:31,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-28 02:38:31,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710576381] [2024-11-28 02:38:31,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710576381] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:38:31,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394229882] [2024-11-28 02:38:31,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:31,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:38:31,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b27c8e25-41a2-4925-9bfc-8014977ed80e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:38:31,158 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b27c8e25-41a2-4925-9bfc-8014977ed80e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:38:31,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b27c8e25-41a2-4925-9bfc-8014977ed80e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 02:38:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:31,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-28 02:38:31,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:38:31,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:38:31,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394229882] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:38:31,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:38:31,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-11-28 02:38:31,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170809673] [2024-11-28 02:38:31,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:38:31,407 INFO L752 eck$LassoCheckResult]: stem already infeasible [2024-11-28 02:38:31,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:38:31,407 INFO L85 PathProgramCache]: Analyzing trace with hash 5405782, now seen corresponding path program 1 times [2024-11-28 02:38:31,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 02:38:31,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879954699] [2024-11-28 02:38:31,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:31,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:38:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:31,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-28 02:38:31,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879954699] [2024-11-28 02:38:31,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879954699] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:38:31,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388367103] [2024-11-28 02:38:31,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:31,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:38:31,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b27c8e25-41a2-4925-9bfc-8014977ed80e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:38:31,954 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b27c8e25-41a2-4925-9bfc-8014977ed80e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:38:31,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b27c8e25-41a2-4925-9bfc-8014977ed80e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 02:38:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:32,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 02:38:32,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:38:32,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:38:32,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388367103] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:38:32,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:38:32,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-28 02:38:32,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58124598] [2024-11-28 02:38:32,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:38:32,226 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-28 02:38:32,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-28 02:38:32,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:38:32,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:38:32,275 INFO L87 Difference]: Start difference. First operand has 57 states, 56 states have (on average 1.6607142857142858) internal successors, (93), 56 states have internal predecessors, (93), 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 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-28 02:38:32,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:38:32,421 INFO L93 Difference]: Finished difference Result 89 states and 138 transitions. [2024-11-28 02:38:32,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 138 transitions. [2024-11-28 02:38:32,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2024-11-28 02:38:32,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 80 states and 114 transitions. [2024-11-28 02:38:32,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2024-11-28 02:38:32,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2024-11-28 02:38:32,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 114 transitions. [2024-11-28 02:38:32,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-28 02:38:32,441 INFO L218 hiAutomatonCegarLoop]: Abstraction has 80 states and 114 transitions. [2024-11-28 02:38:32,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 114 transitions. [2024-11-28 02:38:32,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 51. [2024-11-28 02:38:32,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 50 states have internal predecessors, (68), 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-28 02:38:32,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2024-11-28 02:38:32,483 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 68 transitions. [2024-11-28 02:38:32,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:38:32,491 INFO L425 stractBuchiCegarLoop]: Abstraction has 51 states and 68 transitions. [2024-11-28 02:38:32,492 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-28 02:38:32,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 68 transitions. [2024-11-28 02:38:32,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2024-11-28 02:38:32,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 02:38:32,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 02:38:32,495 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:38:32,495 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:38:32,495 INFO L747 eck$LassoCheckResult]: Stem: "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(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;" "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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~ret17#1, main_#t~ret18#1, main_#t~post19#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~mode1~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume 0 == main_#t~nondet12#1 || 1 == main_#t~nondet12#1;~mode2~0 := (if 0 == main_#t~nondet12#1 % 256 then 0 else 1);havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode3~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1;" "assume 0 == ~r1~0;" "assume ~id1~0 >= 0;" "assume 0 == ~st1~0;" "assume ~send1~0 == ~id1~0;" "assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296);" "assume ~id2~0 >= 0;" "assume 0 == ~st2~0;" "assume ~send2~0 == ~id2~0;" "assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296);" "assume ~id3~0 >= 0;" "assume 0 == ~st3~0;" "assume ~send3~0 == ~id3~0;" "assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296);" "assume ~id1~0 != ~id2~0;" "assume ~id1~0 != ~id3~0;" "assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1;" "init_#res#1 := init_~tmp~0#1;" "main_#t~ret17#1 := init_#res#1;havoc init_~tmp~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret17#1;havoc main_#t~ret17#1;" "assume !(0 == main_~i2~0#1);" "~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2024-11-28 02:38:32,496 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~i2~0#1 < 6;" "assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0;" "assume !(0 != ~mode1~0 % 256);~p1_new~0 := (if (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 <= 127 then (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 else (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 - 256);~mode1~0 := 1;" "havoc node1_~m1~0#1;assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0;" "assume !(0 != ~mode2~0 % 256);~p2_new~0 := (if (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 <= 127 then (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 else (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 - 256);~mode2~0 := 1;" "havoc node2_~m2~0#1;assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0;" "assume !(0 != ~mode3~0 % 256);~p3_new~0 := (if (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 <= 127 then (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 else (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 - 256);~mode3~0 := 1;" "havoc node3_~m3~0#1;assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1;" "assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret18#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret18#1;havoc main_#t~ret18#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post19#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" [2024-11-28 02:38:32,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:38:32,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 1 times [2024-11-28 02:38:32,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 02:38:32,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100381766] [2024-11-28 02:38:32,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:32,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:38:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:38:32,543 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 02:38:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:38:32,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 02:38:32,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:38:32,638 INFO L85 PathProgramCache]: Analyzing trace with hash 5405782, now seen corresponding path program 2 times [2024-11-28 02:38:32,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 02:38:32,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656318695] [2024-11-28 02:38:32,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:32,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:38:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:32,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-28 02:38:32,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656318695] [2024-11-28 02:38:32,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656318695] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:38:32,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696074991] [2024-11-28 02:38:32,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:32,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:38:32,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b27c8e25-41a2-4925-9bfc-8014977ed80e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:38:32,948 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b27c8e25-41a2-4925-9bfc-8014977ed80e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:38:32,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b27c8e25-41a2-4925-9bfc-8014977ed80e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 02:38:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:33,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 02:38:33,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:38:33,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:38:33,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696074991] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:38:33,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:38:33,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-28 02:38:33,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181019495] [2024-11-28 02:38:33,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:38:33,204 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-28 02:38:33,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-28 02:38:33,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:38:33,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:38:33,208 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. cyclomatic complexity: 18 Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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-28 02:38:33,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:38:33,261 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2024-11-28 02:38:33,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 70 transitions. [2024-11-28 02:38:33,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2024-11-28 02:38:33,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 51 states and 65 transitions. [2024-11-28 02:38:33,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2024-11-28 02:38:33,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2024-11-28 02:38:33,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 65 transitions. [2024-11-28 02:38:33,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-28 02:38:33,269 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 65 transitions. [2024-11-28 02:38:33,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 65 transitions. [2024-11-28 02:38:33,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-28 02:38:33,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 50 states have internal predecessors, (65), 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-28 02:38:33,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2024-11-28 02:38:33,280 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 65 transitions. [2024-11-28 02:38:33,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:38:33,281 INFO L425 stractBuchiCegarLoop]: Abstraction has 51 states and 65 transitions. [2024-11-28 02:38:33,282 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-28 02:38:33,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 65 transitions. [2024-11-28 02:38:33,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2024-11-28 02:38:33,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 02:38:33,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 02:38:33,287 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:38:33,287 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:38:33,288 INFO L747 eck$LassoCheckResult]: Stem: "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(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;" "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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~ret17#1, main_#t~ret18#1, main_#t~post19#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~mode1~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume 0 == main_#t~nondet12#1 || 1 == main_#t~nondet12#1;~mode2~0 := (if 0 == main_#t~nondet12#1 % 256 then 0 else 1);havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode3~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1;" "assume 0 == ~r1~0;" "assume ~id1~0 >= 0;" "assume 0 == ~st1~0;" "assume ~send1~0 == ~id1~0;" "assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296);" "assume ~id2~0 >= 0;" "assume 0 == ~st2~0;" "assume ~send2~0 == ~id2~0;" "assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296);" "assume ~id3~0 >= 0;" "assume 0 == ~st3~0;" "assume ~send3~0 == ~id3~0;" "assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296);" "assume ~id1~0 != ~id2~0;" "assume ~id1~0 != ~id3~0;" "assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1;" "init_#res#1 := init_~tmp~0#1;" "main_#t~ret17#1 := init_#res#1;havoc init_~tmp~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret17#1;havoc main_#t~ret17#1;" "assume !(0 == main_~i2~0#1);" "~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2024-11-28 02:38:33,288 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~i2~0#1 < 6;" "assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0;" "assume !(0 != ~mode1~0 % 256);~p1_new~0 := (if (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 <= 127 then (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 else (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 - 256);~mode1~0 := 1;" "havoc node1_~m1~0#1;assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0;" "assume !(0 != ~mode2~0 % 256);~p2_new~0 := (if (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 <= 127 then (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 else (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 - 256);~mode2~0 := 1;" "havoc node2_~m2~0#1;assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0;" "assume !(0 != ~mode3~0 % 256);~p3_new~0 := (if (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 <= 127 then (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 else (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 - 256);~mode3~0 := 1;" "havoc node3_~m3~0#1;assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1;" "assume ~st1~0 + ~st2~0 + ~st3~0 <= 1;" "assume ~r1~0 >= 3;" "assume ~r1~0 < 3;check_~tmp~1#1 := 1;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret18#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret18#1;havoc main_#t~ret18#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post19#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" [2024-11-28 02:38:33,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:38:33,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 2 times [2024-11-28 02:38:33,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 02:38:33,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997232943] [2024-11-28 02:38:33,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:33,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:38:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:38:33,326 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 02:38:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:38:33,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 02:38:33,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:38:33,375 INFO L85 PathProgramCache]: Analyzing trace with hash -515896506, now seen corresponding path program 1 times [2024-11-28 02:38:33,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 02:38:33,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768125032] [2024-11-28 02:38:33,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:33,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:38:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:33,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-28 02:38:33,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768125032] [2024-11-28 02:38:33,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768125032] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:38:33,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971934980] [2024-11-28 02:38:33,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:33,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:38:33,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b27c8e25-41a2-4925-9bfc-8014977ed80e/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:38:33,439 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b27c8e25-41a2-4925-9bfc-8014977ed80e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:38:33,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b27c8e25-41a2-4925-9bfc-8014977ed80e/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 02:38:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:38:33,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 02:38:33,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:38:33,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:38:33,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971934980] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 02:38:33,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 02:38:33,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-11-28 02:38:33,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159814557] [2024-11-28 02:38:33,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 02:38:33,550 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-28 02:38:33,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-28 02:38:33,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:38:33,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:38:33,551 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-28 02:38:33,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:38:33,592 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2024-11-28 02:38:33,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 97 transitions. [2024-11-28 02:38:33,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2024-11-28 02:38:33,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 74 states and 97 transitions. [2024-11-28 02:38:33,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2024-11-28 02:38:33,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2024-11-28 02:38:33,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 97 transitions. [2024-11-28 02:38:33,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-28 02:38:33,600 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 97 transitions. [2024-11-28 02:38:33,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 97 transitions. [2024-11-28 02:38:33,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-28 02:38:33,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 73 states have internal predecessors, (97), 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-28 02:38:33,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 97 transitions. [2024-11-28 02:38:33,609 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 97 transitions. [2024-11-28 02:38:33,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:38:33,612 INFO L425 stractBuchiCegarLoop]: Abstraction has 74 states and 97 transitions. [2024-11-28 02:38:33,612 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-28 02:38:33,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 97 transitions. [2024-11-28 02:38:33,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2024-11-28 02:38:33,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-28 02:38:33,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-28 02:38:33,614 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:38:33,614 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:38:33,616 INFO L747 eck$LassoCheckResult]: Stem: "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(34, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;" "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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~ret17#1, main_#t~ret18#1, main_#t~post19#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~mode1~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume 0 == main_#t~nondet12#1 || 1 == main_#t~nondet12#1;~mode2~0 := (if 0 == main_#t~nondet12#1 % 256 then 0 else 1);havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode3~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1;" "assume 0 == ~r1~0;" "assume ~id1~0 >= 0;" "assume 0 == ~st1~0;" "assume ~send1~0 == ~id1~0;" "assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296);" "assume ~id2~0 >= 0;" "assume 0 == ~st2~0;" "assume ~send2~0 == ~id2~0;" "assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296);" "assume ~id3~0 >= 0;" "assume 0 == ~st3~0;" "assume ~send3~0 == ~id3~0;" "assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296);" "assume ~id1~0 != ~id2~0;" "assume ~id1~0 != ~id3~0;" "assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1;" "init_#res#1 := init_~tmp~0#1;" "main_#t~ret17#1 := init_#res#1;havoc init_~tmp~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret17#1;havoc main_#t~ret17#1;" "assume !(0 == main_~i2~0#1);" "~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0;" [2024-11-28 02:38:33,617 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~i2~0#1 < 6;" "assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0;" "assume !(0 != ~mode1~0 % 256);~p1_new~0 := (if (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 <= 127 then (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 else (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 - 256);~mode1~0 := 1;" "havoc node1_~m1~0#1;assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0;" "assume !(0 != ~mode2~0 % 256);~p2_new~0 := (if (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 <= 127 then (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 else (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 - 256);~mode2~0 := 1;" "havoc node2_~m2~0#1;assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0;" "assume !(0 != ~mode3~0 % 256);~p3_new~0 := (if (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 <= 127 then (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 else (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 - 256);~mode3~0 := 1;" "havoc node3_~m3~0#1;assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1;" "assume ~st1~0 + ~st2~0 + ~st3~0 <= 1;" "assume !(~r1~0 >= 3);" "assume 0 == ~st1~0 + ~st2~0 + ~st3~0;" "assume ~r1~0 < 3;check_~tmp~1#1 := 1;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret18#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret18#1;havoc main_#t~ret18#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post19#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1;" [2024-11-28 02:38:33,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:38:33,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 3 times [2024-11-28 02:38:33,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 02:38:33,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145940228] [2024-11-28 02:38:33,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:33,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:38:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:38:33,651 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 02:38:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:38:33,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 02:38:33,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:38:33,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1461319909, now seen corresponding path program 1 times [2024-11-28 02:38:33,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 02:38:33,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376902593] [2024-11-28 02:38:33,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:33,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:38:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:38:33,724 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 02:38:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:38:33,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 02:38:33,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:38:33,745 INFO L85 PathProgramCache]: Analyzing trace with hash -259915367, now seen corresponding path program 1 times [2024-11-28 02:38:33,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-28 02:38:33,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176119070] [2024-11-28 02:38:33,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:38:33,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:38:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:38:33,780 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 02:38:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:38:33,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-28 02:38:37,860 INFO L204 LassoAnalysis]: Preferences: [2024-11-28 02:38:37,862 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-28 02:38:37,862 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-28 02:38:37,862 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-28 02:38:37,862 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-28 02:38:37,863 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-28 02:38:37,863 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-28 02:38:37,863 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-28 02:38:37,863 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2024-11-28 02:38:37,863 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-28 02:38:37,864 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-28 02:38:37,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 02:38:37,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 02:38:37,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 02:38:37,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 02:38:37,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 02:38:37,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 02:38:37,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 02:38:37,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 02:38:37,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 02:38:37,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 02:38:37,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 02:38:37,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 02:38:39,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 02:38:39,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 02:38:39,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 02:38:39,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-28 02:38:40,437 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 19