./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 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5b0ce4f-f21d-446c-a282-415d3797bd1b/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5b0ce4f-f21d-446c-a282-415d3797bd1b/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5b0ce4f-f21d-446c-a282-415d3797bd1b/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5b0ce4f-f21d-446c-a282-415d3797bd1b/bin/uautomizer-verify-BQ2R08f2Ya/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_c5b0ce4f-f21d-446c-a282-415d3797bd1b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5b0ce4f-f21d-446c-a282-415d3797bd1b/bin/uautomizer-verify-BQ2R08f2Ya --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.2.4-dev-0e0057c [2023-11-29 05:50:12,232 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:50:12,297 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5b0ce4f-f21d-446c-a282-415d3797bd1b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-29 05:50:12,301 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:50:12,302 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:50:12,327 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:50:12,328 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:50:12,328 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:50:12,329 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:50:12,330 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:50:12,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:50:12,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:50:12,332 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:50:12,332 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-29 05:50:12,333 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-29 05:50:12,333 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-29 05:50:12,334 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-29 05:50:12,334 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-29 05:50:12,335 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-29 05:50:12,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:50:12,336 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-29 05:50:12,336 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:50:12,337 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:50:12,337 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:50:12,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:50:12,338 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-29 05:50:12,339 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-29 05:50:12,339 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-29 05:50:12,339 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:50:12,340 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:50:12,340 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:50:12,341 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-29 05:50:12,341 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:50:12,341 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:50:12,342 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:50:12,342 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:50:12,342 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:50:12,343 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-29 05:50:12,343 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_c5b0ce4f-f21d-446c-a282-415d3797bd1b/bin/uautomizer-verify-BQ2R08f2Ya/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_c5b0ce4f-f21d-446c-a282-415d3797bd1b/bin/uautomizer-verify-BQ2R08f2Ya 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 [2023-11-29 05:50:12,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:50:12,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:50:12,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:50:12,613 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:50:12,613 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:50:12,614 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5b0ce4f-f21d-446c-a282-415d3797bd1b/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2023-11-29 05:50:15,333 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:50:15,555 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:50:15,556 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5b0ce4f-f21d-446c-a282-415d3797bd1b/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2023-11-29 05:50:15,565 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5b0ce4f-f21d-446c-a282-415d3797bd1b/bin/uautomizer-verify-BQ2R08f2Ya/data/ec88348ab/ed5e1c28846e4fbaa7bd0e7266094993/FLAG382b9d8c8 [2023-11-29 05:50:15,578 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5b0ce4f-f21d-446c-a282-415d3797bd1b/bin/uautomizer-verify-BQ2R08f2Ya/data/ec88348ab/ed5e1c28846e4fbaa7bd0e7266094993 [2023-11-29 05:50:15,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:50:15,581 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:50:15,582 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:50:15,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:50:15,586 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:50:15,586 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:50:15" (1/1) ... [2023-11-29 05:50:15,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@738fb02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:15, skipping insertion in model container [2023-11-29 05:50:15,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:50:15" (1/1) ... [2023-11-29 05:50:15,620 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:50:15,814 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:50:15,829 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:50:15,868 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:50:15,885 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:50:15,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:15 WrapperNode [2023-11-29 05:50:15,886 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:50:15,887 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:50:15,887 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:50:15,887 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:50:15,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:15" (1/1) ... [2023-11-29 05:50:15,903 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:15" (1/1) ... [2023-11-29 05:50:15,932 INFO L138 Inliner]: procedures = 21, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 209 [2023-11-29 05:50:15,932 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:50:15,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:50:15,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:50:15,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:50:15,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:15" (1/1) ... [2023-11-29 05:50:15,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:15" (1/1) ... [2023-11-29 05:50:15,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:15" (1/1) ... [2023-11-29 05:50:15,963 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]. [2023-11-29 05:50:15,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:15" (1/1) ... [2023-11-29 05:50:15,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:15" (1/1) ... [2023-11-29 05:50:15,969 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:15" (1/1) ... [2023-11-29 05:50:15,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:15" (1/1) ... [2023-11-29 05:50:15,976 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:15" (1/1) ... [2023-11-29 05:50:15,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:15" (1/1) ... [2023-11-29 05:50:15,981 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:50:15,982 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:50:15,982 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:50:15,982 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:50:15,983 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:15" (1/1) ... [2023-11-29 05:50:15,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:50:16,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5b0ce4f-f21d-446c-a282-415d3797bd1b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:50:16,014 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5b0ce4f-f21d-446c-a282-415d3797bd1b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 05:50:16,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5b0ce4f-f21d-446c-a282-415d3797bd1b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-29 05:50:16,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:50:16,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:50:16,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:50:16,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:50:16,127 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:50:16,129 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:50:16,393 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:50:16,404 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:50:16,404 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 05:50:16,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:50:16 BoogieIcfgContainer [2023-11-29 05:50:16,405 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:50:16,406 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-29 05:50:16,406 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-29 05:50:16,409 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-29 05:50:16,410 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 05:50:16,410 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 05:50:15" (1/3) ... [2023-11-29 05:50:16,410 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68cbb48a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 05:50:16, skipping insertion in model container [2023-11-29 05:50:16,410 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 05:50:16,411 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:15" (2/3) ... [2023-11-29 05:50:16,411 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68cbb48a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 05:50:16, skipping insertion in model container [2023-11-29 05:50:16,411 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 05:50:16,411 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:50:16" (3/3) ... [2023-11-29 05:50:16,412 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2023-11-29 05:50:16,454 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-29 05:50:16,454 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-29 05:50:16,455 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-29 05:50:16,455 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-29 05:50:16,455 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-29 05:50:16,455 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-29 05:50:16,455 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-29 05:50:16,455 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-29 05:50:16,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 56 states, 55 states have (on average 1.6727272727272726) internal successors, (92), 55 states have internal predecessors, (92), 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) [2023-11-29 05:50:16,476 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2023-11-29 05:50:16,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:50:16,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:50:16,483 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:16,483 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:16,483 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-29 05:50:16,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 56 states, 55 states have (on average 1.6727272727272726) internal successors, (92), 55 states have internal predecessors, (92), 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) [2023-11-29 05:50:16,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2023-11-29 05:50:16,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:50:16,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:50:16,490 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:16,490 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:16,496 INFO L748 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(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; 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;~mode1~0 := main_#t~nondet8#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;~mode2~0 := main_#t~nondet12#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;~mode3~0 := main_#t~nondet16#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; 38#L131true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 23#L131-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#L248true assume !(0 == main_~i2~0#1); 28#L248-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; 11#L256-2true [2023-11-29 05:50:16,497 INFO L750 eck$LassoCheckResult]: Loop: 11#L256-2true 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; 12#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; 20#L82true 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; 51#L82-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; 46#L107true 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; 56#L107-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; 35#L204true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 44#L204-1true check_#res#1 := check_~tmp~1#1; 15#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; 22#L280true assume !(0 == assert_~arg#1 % 256); 36#L275true 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; 11#L256-2true [2023-11-29 05:50:16,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:16,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1892699938, now seen corresponding path program 1 times [2023-11-29 05:50:16,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:16,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229420586] [2023-11-29 05:50:16,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:16,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:16,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:50:16,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:16,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229420586] [2023-11-29 05:50:16,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229420586] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:16,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:16,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:50:16,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802142411] [2023-11-29 05:50:16,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:16,714 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 05:50:16,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:16,715 INFO L85 PathProgramCache]: Analyzing trace with hash 317704966, now seen corresponding path program 1 times [2023-11-29 05:50:16,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:16,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670429148] [2023-11-29 05:50:16,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:16,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:17,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:50:17,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:17,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670429148] [2023-11-29 05:50:17,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670429148] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:17,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:17,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:50:17,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156616283] [2023-11-29 05:50:17,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:17,038 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 05:50:17,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:17,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:50:17,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:50:17,069 INFO L87 Difference]: Start difference. First operand has 56 states, 55 states have (on average 1.6727272727272726) internal successors, (92), 55 states have internal predecessors, (92), 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) [2023-11-29 05:50:17,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:50:17,157 INFO L93 Difference]: Finished difference Result 87 states and 136 transitions. [2023-11-29 05:50:17,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 136 transitions. [2023-11-29 05:50:17,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2023-11-29 05:50:17,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 78 states and 112 transitions. [2023-11-29 05:50:17,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2023-11-29 05:50:17,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2023-11-29 05:50:17,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 112 transitions. [2023-11-29 05:50:17,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:50:17,173 INFO L218 hiAutomatonCegarLoop]: Abstraction has 78 states and 112 transitions. [2023-11-29 05:50:17,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 112 transitions. [2023-11-29 05:50:17,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 50. [2023-11-29 05:50:17,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.34) internal successors, (67), 49 states have internal predecessors, (67), 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) [2023-11-29 05:50:17,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2023-11-29 05:50:17,206 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 67 transitions. [2023-11-29 05:50:17,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:50:17,211 INFO L428 stractBuchiCegarLoop]: Abstraction has 50 states and 67 transitions. [2023-11-29 05:50:17,212 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-29 05:50:17,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 67 transitions. [2023-11-29 05:50:17,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2023-11-29 05:50:17,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:50:17,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:50:17,215 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] [2023-11-29 05:50:17,215 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:17,216 INFO L748 eck$LassoCheckResult]: Stem: 195#$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(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; 196#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;~mode1~0 := main_#t~nondet8#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;~mode2~0 := main_#t~nondet12#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;~mode3~0 := main_#t~nondet16#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; 203#L131 assume 0 == ~r1~0; 207#L132 assume ~id1~0 >= 0; 205#L133 assume 0 == ~st1~0; 206#L134 assume ~send1~0 == ~id1~0; 202#L135 assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296); 180#L136 assume ~id2~0 >= 0; 181#L137 assume 0 == ~st2~0; 210#L138 assume ~send2~0 == ~id2~0; 193#L139 assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296); 194#L140 assume ~id3~0 >= 0; 208#L141 assume 0 == ~st3~0; 198#L142 assume ~send3~0 == ~id3~0; 197#L143 assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296); 170#L144 assume ~id1~0 != ~id2~0; 171#L145 assume ~id1~0 != ~id3~0; 185#L146 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 186#L131-1 init_#res#1 := init_~tmp~0#1; 188#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; 189#L248 assume !(0 == main_~i2~0#1); 199#L248-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; 176#L256-2 [2023-11-29 05:50:17,216 INFO L750 eck$LassoCheckResult]: Loop: 176#L256-2 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; 161#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; 163#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; 177#L82 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; 191#L82-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; 209#L107 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; 184#L107-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; 204#L204 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 178#L204-1 check_#res#1 := check_~tmp~1#1; 182#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; 183#L280 assume !(0 == assert_~arg#1 % 256); 192#L275 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; 176#L256-2 [2023-11-29 05:50:17,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:17,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 1 times [2023-11-29 05:50:17,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:17,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779063747] [2023-11-29 05:50:17,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:17,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:50:17,238 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:50:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:50:17,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:50:17,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:17,280 INFO L85 PathProgramCache]: Analyzing trace with hash 317704966, now seen corresponding path program 2 times [2023-11-29 05:50:17,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:17,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363400456] [2023-11-29 05:50:17,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:17,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:17,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:17,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:50:17,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:17,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363400456] [2023-11-29 05:50:17,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363400456] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:17,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:17,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:50:17,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270276313] [2023-11-29 05:50:17,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:17,446 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 05:50:17,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:17,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:50:17,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:50:17,447 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. cyclomatic complexity: 18 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:17,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:50:17,487 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2023-11-29 05:50:17,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 69 transitions. [2023-11-29 05:50:17,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2023-11-29 05:50:17,490 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 50 states and 64 transitions. [2023-11-29 05:50:17,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2023-11-29 05:50:17,491 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2023-11-29 05:50:17,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 64 transitions. [2023-11-29 05:50:17,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:50:17,492 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 64 transitions. [2023-11-29 05:50:17,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 64 transitions. [2023-11-29 05:50:17,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-11-29 05:50:17,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.28) internal successors, (64), 49 states have internal predecessors, (64), 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) [2023-11-29 05:50:17,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2023-11-29 05:50:17,497 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 64 transitions. [2023-11-29 05:50:17,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:50:17,498 INFO L428 stractBuchiCegarLoop]: Abstraction has 50 states and 64 transitions. [2023-11-29 05:50:17,498 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-29 05:50:17,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 64 transitions. [2023-11-29 05:50:17,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2023-11-29 05:50:17,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:50:17,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:50:17,501 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] [2023-11-29 05:50:17,501 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:17,501 INFO L748 eck$LassoCheckResult]: Stem: 310#$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(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; 311#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;~mode1~0 := main_#t~nondet8#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;~mode2~0 := main_#t~nondet12#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;~mode3~0 := main_#t~nondet16#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; 318#L131 assume 0 == ~r1~0; 322#L132 assume ~id1~0 >= 0; 320#L133 assume 0 == ~st1~0; 321#L134 assume ~send1~0 == ~id1~0; 317#L135 assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296); 295#L136 assume ~id2~0 >= 0; 296#L137 assume 0 == ~st2~0; 325#L138 assume ~send2~0 == ~id2~0; 308#L139 assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296); 309#L140 assume ~id3~0 >= 0; 323#L141 assume 0 == ~st3~0; 313#L142 assume ~send3~0 == ~id3~0; 312#L143 assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296); 285#L144 assume ~id1~0 != ~id2~0; 286#L145 assume ~id1~0 != ~id3~0; 300#L146 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 301#L131-1 init_#res#1 := init_~tmp~0#1; 303#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; 304#L248 assume !(0 == main_~i2~0#1); 314#L248-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; 291#L256-2 [2023-11-29 05:50:17,501 INFO L750 eck$LassoCheckResult]: Loop: 291#L256-2 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; 279#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; 281#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; 292#L82 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; 306#L82-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; 324#L107 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; 299#L107-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; 319#L204 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 287#L205 assume ~r1~0 >= 3; 288#$Ultimate##101 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 293#L204-1 check_#res#1 := check_~tmp~1#1; 297#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; 298#L280 assume !(0 == assert_~arg#1 % 256); 307#L275 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; 291#L256-2 [2023-11-29 05:50:17,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:17,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 2 times [2023-11-29 05:50:17,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:17,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613798470] [2023-11-29 05:50:17,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:17,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:50:17,515 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:50:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:50:17,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:50:17,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:17,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1044091434, now seen corresponding path program 1 times [2023-11-29 05:50:17,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:17,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284679910] [2023-11-29 05:50:17,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:17,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:17,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:50:17,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:17,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284679910] [2023-11-29 05:50:17,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284679910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:17,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:17,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:50:17,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547563751] [2023-11-29 05:50:17,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:17,559 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 05:50:17,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:17,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:50:17,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:50:17,560 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2023-11-29 05:50:17,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:50:17,581 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2023-11-29 05:50:17,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 95 transitions. [2023-11-29 05:50:17,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2023-11-29 05:50:17,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 95 transitions. [2023-11-29 05:50:17,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2023-11-29 05:50:17,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2023-11-29 05:50:17,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 95 transitions. [2023-11-29 05:50:17,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:50:17,585 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 95 transitions. [2023-11-29 05:50:17,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 95 transitions. [2023-11-29 05:50:17,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-11-29 05:50:17,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 71 states have internal predecessors, (95), 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) [2023-11-29 05:50:17,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2023-11-29 05:50:17,591 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 95 transitions. [2023-11-29 05:50:17,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:50:17,592 INFO L428 stractBuchiCegarLoop]: Abstraction has 72 states and 95 transitions. [2023-11-29 05:50:17,593 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-29 05:50:17,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 95 transitions. [2023-11-29 05:50:17,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2023-11-29 05:50:17,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 05:50:17,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 05:50:17,595 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] [2023-11-29 05:50:17,595 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:17,596 INFO L748 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(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; 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;~mode1~0 := main_#t~nondet8#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;~mode2~0 := main_#t~nondet12#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;~mode3~0 := main_#t~nondet16#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; 448#L131 assume 0 == ~r1~0; 452#L132 assume ~id1~0 >= 0; 450#L133 assume 0 == ~st1~0; 451#L134 assume ~send1~0 == ~id1~0; 445#L135 assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296); 422#L136 assume ~id2~0 >= 0; 423#L137 assume 0 == ~st2~0; 456#L138 assume ~send2~0 == ~id2~0; 435#L139 assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296); 436#L140 assume ~id3~0 >= 0; 453#L141 assume 0 == ~st3~0; 440#L142 assume ~send3~0 == ~id3~0; 439#L143 assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296); 413#L144 assume ~id1~0 != ~id2~0; 414#L145 assume ~id1~0 != ~id3~0; 427#L146 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 428#L131-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#L248 assume !(0 == main_~i2~0#1); 441#L248-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; 442#L256-2 [2023-11-29 05:50:17,596 INFO L750 eck$LassoCheckResult]: Loop: 442#L256-2 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; 471#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; 418#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; 467#L82 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; 465#L82-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; 460#L107 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; 459#L107-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; 458#L204 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 457#L205 assume !(~r1~0 >= 3); 446#L208 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 447#$Ultimate##101 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 475#L204-1 check_#res#1 := check_~tmp~1#1; 474#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; 473#L280 assume !(0 == assert_~arg#1 % 256); 472#L275 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; 442#L256-2 [2023-11-29 05:50:17,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:17,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 3 times [2023-11-29 05:50:17,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:17,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332274183] [2023-11-29 05:50:17,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:17,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:50:17,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:50:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:50:17,621 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:50:17,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:17,622 INFO L85 PathProgramCache]: Analyzing trace with hash -655493494, now seen corresponding path program 1 times [2023-11-29 05:50:17,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:17,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866995576] [2023-11-29 05:50:17,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:17,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:50:17,640 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:50:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:50:17,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:50:17,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:17,685 INFO L85 PathProgramCache]: Analyzing trace with hash 214545484, now seen corresponding path program 1 times [2023-11-29 05:50:17,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:17,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405603846] [2023-11-29 05:50:17,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:17,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:50:17,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:50:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:50:17,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:50:19,468 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 05:50:19,469 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 05:50:19,469 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 05:50:19,469 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 05:50:19,469 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-29 05:50:19,469 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 05:50:19,469 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 05:50:19,469 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 05:50:19,469 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2023-11-29 05:50:19,470 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 05:50:19,470 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 05:50:19,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:50:19,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:50:19,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:50:19,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:50:19,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:50:19,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:50:19,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:50:19,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:50:19,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:50:19,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:50:19,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:50:19,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:50:19,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:50:19,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:50:19,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:50:19,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:50:20,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 05:50:21,206 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 17 [2023-11-29 05:50:55,124 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 1305920 conjunctions. This might take some time...