./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b62a726-f34a-4328-aa5e-f0a12f13c26a/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b62a726-f34a-4328-aa5e-f0a12f13c26a/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b62a726-f34a-4328-aa5e-f0a12f13c26a/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b62a726-f34a-4328-aa5e-f0a12f13c26a/bin/uautomizer-verify-jihMAELWvX/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b62a726-f34a-4328-aa5e-f0a12f13c26a/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b62a726-f34a-4328-aa5e-f0a12f13c26a/bin/uautomizer-verify-jihMAELWvX --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 25ff40e1cab2a460fc960bb835e8a5bb98b4f09095caa25e5ce8f52bf887c901 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:07:08,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:07:08,542 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b62a726-f34a-4328-aa5e-f0a12f13c26a/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-08 19:07:08,547 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:07:08,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:07:08,586 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:07:08,589 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:07:08,590 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:07:08,591 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:07:08,591 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:07:08,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:07:08,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:07:08,594 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:07:08,596 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-08 19:07:08,597 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-08 19:07:08,598 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-08 19:07:08,598 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-08 19:07:08,598 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-08 19:07:08,599 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-08 19:07:08,599 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:07:08,603 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-08 19:07:08,603 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:07:08,604 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:07:08,604 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:07:08,605 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:07:08,606 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-08 19:07:08,606 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-08 19:07:08,607 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-08 19:07:08,607 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:07:08,607 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 19:07:08,607 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:07:08,608 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:07:08,608 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-08 19:07:08,609 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:07:08,609 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:07:08,610 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:07:08,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:07:08,611 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:07:08,611 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-08 19:07:08,612 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b62a726-f34a-4328-aa5e-f0a12f13c26a/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_4b62a726-f34a-4328-aa5e-f0a12f13c26a/bin/uautomizer-verify-jihMAELWvX 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 -> 25ff40e1cab2a460fc960bb835e8a5bb98b4f09095caa25e5ce8f52bf887c901 [2024-11-08 19:07:08,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:07:08,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:07:08,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:07:09,000 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:07:09,001 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:07:09,003 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b62a726-f34a-4328-aa5e-f0a12f13c26a/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c Unable to find full path for "g++" [2024-11-08 19:07:11,137 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:07:11,335 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:07:11,336 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b62a726-f34a-4328-aa5e-f0a12f13c26a/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c [2024-11-08 19:07:11,345 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b62a726-f34a-4328-aa5e-f0a12f13c26a/bin/uautomizer-verify-jihMAELWvX/data/0638d6d28/882a8d9015b74c95a3a87b8d87b935d7/FLAG800b87d7e [2024-11-08 19:07:11,361 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b62a726-f34a-4328-aa5e-f0a12f13c26a/bin/uautomizer-verify-jihMAELWvX/data/0638d6d28/882a8d9015b74c95a3a87b8d87b935d7 [2024-11-08 19:07:11,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:07:11,365 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:07:11,367 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:07:11,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:07:11,373 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:07:11,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:07:11" (1/1) ... [2024-11-08 19:07:11,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28a74103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:07:11, skipping insertion in model container [2024-11-08 19:07:11,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:07:11" (1/1) ... [2024-11-08 19:07:11,420 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:07:11,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:07:11,657 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:07:11,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:07:11,717 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:07:11,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:07:11 WrapperNode [2024-11-08 19:07:11,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:07:11,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:07:11,719 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:07:11,719 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:07:11,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:07:11" (1/1) ... [2024-11-08 19:07:11,742 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:07:11" (1/1) ... [2024-11-08 19:07:11,772 INFO L138 Inliner]: procedures = 21, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 210 [2024-11-08 19:07:11,772 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:07:11,773 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:07:11,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:07:11,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:07:11,786 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:07:11" (1/1) ... [2024-11-08 19:07:11,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:07:11" (1/1) ... [2024-11-08 19:07:11,789 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:07:11" (1/1) ... [2024-11-08 19:07:11,803 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-08 19:07:11,804 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:07:11" (1/1) ... [2024-11-08 19:07:11,804 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:07:11" (1/1) ... [2024-11-08 19:07:11,809 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:07:11" (1/1) ... [2024-11-08 19:07:11,814 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:07:11" (1/1) ... [2024-11-08 19:07:11,816 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:07:11" (1/1) ... [2024-11-08 19:07:11,817 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:07:11" (1/1) ... [2024-11-08 19:07:11,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:07:11,821 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:07:11,822 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:07:11,822 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:07:11,823 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:07:11" (1/1) ... [2024-11-08 19:07:11,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 19:07:11,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b62a726-f34a-4328-aa5e-f0a12f13c26a/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:07:11,865 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b62a726-f34a-4328-aa5e-f0a12f13c26a/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 19:07:11,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b62a726-f34a-4328-aa5e-f0a12f13c26a/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-08 19:07:11,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:07:11,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:07:11,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:07:11,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:07:12,011 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:07:12,014 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:07:12,407 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-11-08 19:07:12,407 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:07:12,425 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:07:12,425 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 19:07:12,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:07:12 BoogieIcfgContainer [2024-11-08 19:07:12,426 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:07:12,427 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-08 19:07:12,427 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-08 19:07:12,431 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-08 19:07:12,431 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-08 19:07:12,432 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.11 07:07:11" (1/3) ... [2024-11-08 19:07:12,433 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@385ad85b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.11 07:07:12, skipping insertion in model container [2024-11-08 19:07:12,433 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-08 19:07:12,433 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:07:11" (2/3) ... [2024-11-08 19:07:12,434 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@385ad85b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.11 07:07:12, skipping insertion in model container [2024-11-08 19:07:12,434 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-08 19:07:12,434 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:07:12" (3/3) ... [2024-11-08 19:07:12,436 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c [2024-11-08 19:07:12,508 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-08 19:07:12,508 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-08 19:07:12,508 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-08 19:07:12,508 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-08 19:07:12,509 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-08 19:07:12,509 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-08 19:07:12,509 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-08 19:07:12,509 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-08 19:07:12,515 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-08 19:07:12,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2024-11-08 19:07:12,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 19:07:12,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 19:07:12,556 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:07:12,556 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:07:12,556 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-08 19:07:12,557 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-08 19:07:12,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2024-11-08 19:07:12,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 19:07:12,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 19:07:12,603 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:07:12,603 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:07:12,620 INFO L745 eck$LassoCheckResult]: Stem: 25#$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(32, 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; 34#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_#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; 40#L129true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 36#L129-1true init_#res#1 := init_~tmp~0#1; 19#init_returnLabel#1true 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; 55#L246true assume !(0 == main_~i2~0#1); 10#L246-2true ~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; 21#L254-3true [2024-11-08 19:07:12,621 INFO L747 eck$LassoCheckResult]: Loop: 21#L254-3true assume main_~i2~0#1 < 6; 5#L254-1true 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; 3#L54true 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; 8#L54-2true 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; 6#L80true 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; 17#L80-2true 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; 15#L105true 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; 35#L105-2true 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; 16#L202true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 28#L202-1true check_#res#1 := check_~tmp~1#1; 14#check_returnLabel#1true 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; 57#L278true assume !(0 == assert_~arg#1 % 256); 51#L273true 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; 21#L254-3true [2024-11-08 19:07:12,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:07:12,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1892699938, now seen corresponding path program 1 times [2024-11-08 19:07:12,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:07:12,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357812141] [2024-11-08 19:07:12,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:07:12,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:07:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:13,092 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-08 19:07:13,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:07:13,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357812141] [2024-11-08 19:07:13,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357812141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:07:13,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:07:13,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:07:13,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151950083] [2024-11-08 19:07:13,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:07:13,101 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-08 19:07:13,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:07:13,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1604150932, now seen corresponding path program 1 times [2024-11-08 19:07:13,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:07:13,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464280347] [2024-11-08 19:07:13,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:07:13,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:07:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:13,543 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-08 19:07:13,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:07:13,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464280347] [2024-11-08 19:07:13,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464280347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:07:13,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:07:13,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:07:13,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902314947] [2024-11-08 19:07:13,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:07:13,546 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 19:07:13,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:07:13,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:07:13,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:07:13,595 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-08 19:07:13,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:07:13,731 INFO L93 Difference]: Finished difference Result 89 states and 139 transitions. [2024-11-08 19:07:13,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 139 transitions. [2024-11-08 19:07:13,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2024-11-08 19:07:13,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 80 states and 114 transitions. [2024-11-08 19:07:13,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2024-11-08 19:07:13,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2024-11-08 19:07:13,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 114 transitions. [2024-11-08 19:07:13,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 19:07:13,749 INFO L218 hiAutomatonCegarLoop]: Abstraction has 80 states and 114 transitions. [2024-11-08 19:07:13,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 114 transitions. [2024-11-08 19:07:13,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 51. [2024-11-08 19:07:13,776 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-08 19:07:13,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2024-11-08 19:07:13,778 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 68 transitions. [2024-11-08 19:07:13,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:07:13,787 INFO L425 stractBuchiCegarLoop]: Abstraction has 51 states and 68 transitions. [2024-11-08 19:07:13,788 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-08 19:07:13,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 68 transitions. [2024-11-08 19:07:13,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2024-11-08 19:07:13,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 19:07:13,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 19:07:13,796 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-08 19:07:13,796 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:07:13,796 INFO L745 eck$LassoCheckResult]: Stem: 193#$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(32, 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; 194#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_#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; 200#L129 assume 0 == ~r1~0; 206#L130 assume ~id1~0 >= 0; 204#L131 assume 0 == ~st1~0; 205#L132 assume ~send1~0 == ~id1~0; 201#L133 assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296); 202#L134 assume ~id2~0 >= 0; 199#L135 assume 0 == ~st2~0; 177#L136 assume ~send2~0 == ~id2~0; 178#L137 assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296); 210#L138 assume ~id3~0 >= 0; 191#L139 assume 0 == ~st3~0; 192#L140 assume ~send3~0 == ~id3~0; 207#L141 assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296); 196#L142 assume ~id1~0 != ~id2~0; 195#L143 assume ~id1~0 != ~id3~0; 163#L144 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 164#L129-1 init_#res#1 := init_~tmp~0#1; 186#init_returnLabel#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; 187#L246 assume !(0 == main_~i2~0#1); 173#L246-2 ~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; 174#L254-3 [2024-11-08 19:07:13,797 INFO L747 eck$LassoCheckResult]: Loop: 174#L254-3 assume main_~i2~0#1 < 6; 165#L254-1 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; 160#L54 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; 162#L54-2 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; 166#L80 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; 168#L80-2 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; 181#L105 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; 176#L105-2 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; 183#L202 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 171#L202-1 check_#res#1 := check_~tmp~1#1; 179#check_returnLabel#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; 180#L278 assume !(0 == assert_~arg#1 % 256); 209#L273 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; 174#L254-3 [2024-11-08 19:07:13,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:07:13,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 1 times [2024-11-08 19:07:13,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:07:13,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061699645] [2024-11-08 19:07:13,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:07:13,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:07:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:07:13,837 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:07:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:07:13,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:07:13,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:07:13,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1604150932, now seen corresponding path program 2 times [2024-11-08 19:07:13,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:07:13,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183760652] [2024-11-08 19:07:13,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:07:13,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:07:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:14,171 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-08 19:07:14,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:07:14,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183760652] [2024-11-08 19:07:14,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183760652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:07:14,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:07:14,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:07:14,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666391028] [2024-11-08 19:07:14,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:07:14,173 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 19:07:14,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:07:14,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:07:14,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:07:14,175 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. cyclomatic complexity: 18 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-08 19:07:14,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:07:14,217 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2024-11-08 19:07:14,217 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 70 transitions. [2024-11-08 19:07:14,219 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2024-11-08 19:07:14,220 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 51 states and 65 transitions. [2024-11-08 19:07:14,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2024-11-08 19:07:14,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2024-11-08 19:07:14,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 65 transitions. [2024-11-08 19:07:14,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 19:07:14,222 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 65 transitions. [2024-11-08 19:07:14,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 65 transitions. [2024-11-08 19:07:14,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-08 19:07:14,225 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-08 19:07:14,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2024-11-08 19:07:14,227 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 65 transitions. [2024-11-08 19:07:14,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:07:14,228 INFO L425 stractBuchiCegarLoop]: Abstraction has 51 states and 65 transitions. [2024-11-08 19:07:14,228 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-08 19:07:14,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 65 transitions. [2024-11-08 19:07:14,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2024-11-08 19:07:14,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 19:07:14,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 19:07:14,231 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-08 19:07:14,231 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:07:14,232 INFO L745 eck$LassoCheckResult]: Stem: 306#$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(32, 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; 307#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_#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; 313#L129 assume 0 == ~r1~0; 319#L130 assume ~id1~0 >= 0; 317#L131 assume 0 == ~st1~0; 318#L132 assume ~send1~0 == ~id1~0; 314#L133 assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296); 315#L134 assume ~id2~0 >= 0; 312#L135 assume 0 == ~st2~0; 290#L136 assume ~send2~0 == ~id2~0; 291#L137 assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296); 323#L138 assume ~id3~0 >= 0; 304#L139 assume 0 == ~st3~0; 305#L140 assume ~send3~0 == ~id3~0; 320#L141 assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296); 309#L142 assume ~id1~0 != ~id2~0; 308#L143 assume ~id1~0 != ~id3~0; 276#L144 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 277#L129-1 init_#res#1 := init_~tmp~0#1; 299#init_returnLabel#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; 300#L246 assume !(0 == main_~i2~0#1); 286#L246-2 ~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; 287#L254-3 [2024-11-08 19:07:14,232 INFO L747 eck$LassoCheckResult]: Loop: 287#L254-3 assume main_~i2~0#1 < 6; 278#L254-1 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; 273#L54 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; 275#L54-2 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; 279#L80 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; 281#L80-2 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; 294#L105 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; 289#L105-2 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; 296#L202 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 297#L203 assume ~r1~0 >= 3; 283#$Ultimate##101 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 284#L202-1 check_#res#1 := check_~tmp~1#1; 292#check_returnLabel#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; 293#L278 assume !(0 == assert_~arg#1 % 256); 322#L273 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; 287#L254-3 [2024-11-08 19:07:14,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:07:14,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 2 times [2024-11-08 19:07:14,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:07:14,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491969230] [2024-11-08 19:07:14,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:07:14,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:07:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:07:14,266 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:07:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:07:14,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:07:14,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:07:14,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1720099356, now seen corresponding path program 1 times [2024-11-08 19:07:14,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:07:14,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188849287] [2024-11-08 19:07:14,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:07:14,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:07:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:07:14,337 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-08 19:07:14,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:07:14,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188849287] [2024-11-08 19:07:14,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188849287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:07:14,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:07:14,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:07:14,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510802306] [2024-11-08 19:07:14,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:07:14,340 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 19:07:14,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:07:14,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:07:14,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:07:14,342 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-08 19:07:14,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:07:14,393 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2024-11-08 19:07:14,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 97 transitions. [2024-11-08 19:07:14,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2024-11-08 19:07:14,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 74 states and 97 transitions. [2024-11-08 19:07:14,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2024-11-08 19:07:14,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2024-11-08 19:07:14,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 97 transitions. [2024-11-08 19:07:14,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 19:07:14,400 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 97 transitions. [2024-11-08 19:07:14,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 97 transitions. [2024-11-08 19:07:14,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-08 19:07:14,410 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-08 19:07:14,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 97 transitions. [2024-11-08 19:07:14,415 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 97 transitions. [2024-11-08 19:07:14,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:07:14,416 INFO L425 stractBuchiCegarLoop]: Abstraction has 74 states and 97 transitions. [2024-11-08 19:07:14,417 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-08 19:07:14,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 97 transitions. [2024-11-08 19:07:14,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2024-11-08 19:07:14,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 19:07:14,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 19:07:14,419 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-08 19:07:14,419 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:07:14,423 INFO L745 eck$LassoCheckResult]: Stem: 437#$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(32, 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; 438#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_#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; 447#L129 assume 0 == ~r1~0; 453#L130 assume ~id1~0 >= 0; 451#L131 assume 0 == ~st1~0; 452#L132 assume ~send1~0 == ~id1~0; 448#L133 assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296); 449#L134 assume ~id2~0 >= 0; 446#L135 assume 0 == ~st2~0; 421#L136 assume ~send2~0 == ~id2~0; 422#L137 assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296); 457#L138 assume ~id3~0 >= 0; 435#L139 assume 0 == ~st3~0; 436#L140 assume ~send3~0 == ~id3~0; 454#L141 assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296); 440#L142 assume ~id1~0 != ~id2~0; 439#L143 assume ~id1~0 != ~id3~0; 407#L144 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 408#L129-1 init_#res#1 := init_~tmp~0#1; 430#init_returnLabel#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; 431#L246 assume !(0 == main_~i2~0#1); 417#L246-2 ~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; 418#L254-3 [2024-11-08 19:07:14,423 INFO L747 eck$LassoCheckResult]: Loop: 418#L254-3 assume main_~i2~0#1 < 6; 473#L254-1 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; 472#L54 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; 414#L54-2 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; 468#L80 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; 466#L80-2 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; 461#L105 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; 460#L105-2 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; 459#L202 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 458#L203 assume !(~r1~0 >= 3); 441#L206 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 442#$Ultimate##101 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 477#L202-1 check_#res#1 := check_~tmp~1#1; 476#check_returnLabel#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; 475#L278 assume !(0 == assert_~arg#1 % 256); 474#L273 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; 418#L254-3 [2024-11-08 19:07:14,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:07:14,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 3 times [2024-11-08 19:07:14,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:07:14,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737140373] [2024-11-08 19:07:14,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:07:14,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:07:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:07:14,462 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:07:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:07:14,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:07:14,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:07:14,508 INFO L85 PathProgramCache]: Analyzing trace with hash -136902596, now seen corresponding path program 1 times [2024-11-08 19:07:14,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:07:14,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400078797] [2024-11-08 19:07:14,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:07:14,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:07:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:07:14,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:07:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:07:14,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:07:14,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:07:14,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1064501946, now seen corresponding path program 1 times [2024-11-08 19:07:14,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:07:14,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622002996] [2024-11-08 19:07:14,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:07:14,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:07:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:07:14,597 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:07:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:07:14,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:07:16,852 INFO L204 LassoAnalysis]: Preferences: [2024-11-08 19:07:16,853 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-08 19:07:16,853 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-08 19:07:16,853 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-08 19:07:16,853 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-08 19:07:16,854 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 19:07:16,854 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-08 19:07:16,854 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-08 19:07:16,854 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2024-11-08 19:07:16,854 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-08 19:07:16,855 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-08 19:07:16,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 19:07:16,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 19:07:16,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 19:07:16,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 19:07:16,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 19:07:16,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 19:07:16,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 19:07:16,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 19:07:16,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 19:07:16,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 19:07:16,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 19:07:16,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 19:07:16,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 19:07:16,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 19:07:18,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 19:07:18,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 19:07:19,368 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2024-11-08 19:07:48,166 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 872480 conjunctions. This might take some time...