./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for termination
Using default analysis
Version 0e0057cc
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_f865e597-b461-4fd3-b79d-d822fa62499f/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f865e597-b461-4fd3-b79d-d822fa62499f/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f865e597-b461-4fd3-b79d-d822fa62499f/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f865e597-b461-4fd3-b79d-d822fa62499f/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f865e597-b461-4fd3-b79d-d822fa62499f/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f865e597-b461-4fd3-b79d-d822fa62499f/bin/uautomizer-verify-VRDe98Ueme --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 5692c849f4d89bdffd108b63efd7f8fc3dfb9eaa92d6e9ffe082f62ca54e1100
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2023-11-26 10:48:10,182 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2023-11-26 10:48:10,258 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f865e597-b461-4fd3-b79d-d822fa62499f/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Termination-32bit-Automizer_Default.epf
[2023-11-26 10:48:10,263 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2023-11-26 10:48:10,263 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-26 10:48:10,288 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-26 10:48:10,289 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-26 10:48:10,290 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-26 10:48:10,291 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2023-11-26 10:48:10,291 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2023-11-26 10:48:10,292 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-26 10:48:10,293 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2023-11-26 10:48:10,293 INFO  L153        SettingsManager]:  * Use SBE=true
[2023-11-26 10:48:10,294 INFO  L151        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2023-11-26 10:48:10,295 INFO  L153        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2023-11-26 10:48:10,295 INFO  L153        SettingsManager]:  * Use old map elimination=false
[2023-11-26 10:48:10,296 INFO  L153        SettingsManager]:  * Use external solver (rank synthesis)=false
[2023-11-26 10:48:10,297 INFO  L153        SettingsManager]:  * Use only trivial implications for array writes=true
[2023-11-26 10:48:10,297 INFO  L153        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2023-11-26 10:48:10,298 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-26 10:48:10,299 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2023-11-26 10:48:10,300 INFO  L153        SettingsManager]:  * sizeof long=4
[2023-11-26 10:48:10,300 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-11-26 10:48:10,301 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2023-11-26 10:48:10,301 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2023-11-26 10:48:10,302 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2023-11-26 10:48:10,303 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2023-11-26 10:48:10,303 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2023-11-26 10:48:10,304 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2023-11-26 10:48:10,304 INFO  L153        SettingsManager]:  * sizeof long double=12
[2023-11-26 10:48:10,305 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2023-11-26 10:48:10,305 INFO  L153        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2023-11-26 10:48:10,306 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2023-11-26 10:48:10,306 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-26 10:48:10,307 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-11-26 10:48:10,307 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-26 10:48:10,308 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-11-26 10:48:10,309 INFO  L151        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2023-11-26 10:48:10,309 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_f865e597-b461-4fd3-b79d-d822fa62499f/bin/uautomizer-verify-VRDe98Ueme/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_f865e597-b461-4fd3-b79d-d822fa62499f/bin/uautomizer-verify-VRDe98Ueme
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 -> 5692c849f4d89bdffd108b63efd7f8fc3dfb9eaa92d6e9ffe082f62ca54e1100
[2023-11-26 10:48:10,555 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-26 10:48:10,584 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-26 10:48:10,587 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-26 10:48:10,589 INFO  L270        PluginConnector]: Initializing CDTParser...
[2023-11-26 10:48:10,589 INFO  L274        PluginConnector]: CDTParser initialized
[2023-11-26 10:48:10,591 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f865e597-b461-4fd3-b79d-d822fa62499f/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c
[2023-11-26 10:48:13,823 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2023-11-26 10:48:14,113 INFO  L384              CDTParser]: Found 1 translation units.
[2023-11-26 10:48:14,114 INFO  L180              CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f865e597-b461-4fd3-b79d-d822fa62499f/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c
[2023-11-26 10:48:14,127 INFO  L427              CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f865e597-b461-4fd3-b79d-d822fa62499f/bin/uautomizer-verify-VRDe98Ueme/data/e867bfa26/7c2ec1d4d81f4bf88e56d2d9e4b91d37/FLAG7f0e4ae06
[2023-11-26 10:48:14,140 INFO  L435              CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f865e597-b461-4fd3-b79d-d822fa62499f/bin/uautomizer-verify-VRDe98Ueme/data/e867bfa26/7c2ec1d4d81f4bf88e56d2d9e4b91d37
[2023-11-26 10:48:14,143 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-26 10:48:14,144 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-26 10:48:14,146 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-26 10:48:14,146 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-26 10:48:14,151 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-26 10:48:14,152 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:48:14" (1/1) ...
[2023-11-26 10:48:14,153 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6545f199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:14, skipping insertion in model container
[2023-11-26 10:48:14,154 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:48:14" (1/1) ...
[2023-11-26 10:48:14,215 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2023-11-26 10:48:14,456 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-11-26 10:48:14,477 INFO  L202         MainTranslator]: Completed pre-run
[2023-11-26 10:48:14,575 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-11-26 10:48:14,594 INFO  L206         MainTranslator]: Completed translation
[2023-11-26 10:48:14,594 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:14 WrapperNode
[2023-11-26 10:48:14,595 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-26 10:48:14,596 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-26 10:48:14,596 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-26 10:48:14,596 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-26 10:48:14,604 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:14" (1/1) ...
[2023-11-26 10:48:14,619 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:14" (1/1) ...
[2023-11-26 10:48:14,678 INFO  L138                Inliner]: procedures = 26, calls = 18, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 422
[2023-11-26 10:48:14,680 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-26 10:48:14,681 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-26 10:48:14,681 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-26 10:48:14,681 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2023-11-26 10:48:14,696 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:14" (1/1) ...
[2023-11-26 10:48:14,697 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:14" (1/1) ...
[2023-11-26 10:48:14,701 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:14" (1/1) ...
[2023-11-26 10:48:14,729 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-26 10:48:14,729 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:14" (1/1) ...
[2023-11-26 10:48:14,730 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:14" (1/1) ...
[2023-11-26 10:48:14,749 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:14" (1/1) ...
[2023-11-26 10:48:14,766 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:14" (1/1) ...
[2023-11-26 10:48:14,769 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:14" (1/1) ...
[2023-11-26 10:48:14,772 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:14" (1/1) ...
[2023-11-26 10:48:14,807 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-26 10:48:14,808 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-26 10:48:14,808 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2023-11-26 10:48:14,808 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2023-11-26 10:48:14,809 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:14" (1/1) ...
[2023-11-26 10:48:14,832 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-11-26 10:48:14,852 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f865e597-b461-4fd3-b79d-d822fa62499f/bin/uautomizer-verify-VRDe98Ueme/z3
[2023-11-26 10:48:14,877 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f865e597-b461-4fd3-b79d-d822fa62499f/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2023-11-26 10:48:14,905 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f865e597-b461-4fd3-b79d-d822fa62499f/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process
[2023-11-26 10:48:14,936 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-26 10:48:14,937 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2023-11-26 10:48:14,938 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-26 10:48:14,938 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-26 10:48:15,092 INFO  L241             CfgBuilder]: Building ICFG
[2023-11-26 10:48:15,094 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-26 10:48:15,683 INFO  L282             CfgBuilder]: Performing block encoding
[2023-11-26 10:48:15,696 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-26 10:48:15,697 INFO  L309             CfgBuilder]: Removed 1 assume(true) statements.
[2023-11-26 10:48:15,699 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:48:15 BoogieIcfgContainer
[2023-11-26 10:48:15,699 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-26 10:48:15,700 INFO  L112        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2023-11-26 10:48:15,701 INFO  L270        PluginConnector]: Initializing BuchiAutomizer...
[2023-11-26 10:48:15,705 INFO  L274        PluginConnector]: BuchiAutomizer initialized
[2023-11-26 10:48:15,706 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2023-11-26 10:48:15,706 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.11 10:48:14" (1/3) ...
[2023-11-26 10:48:15,707 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@326d6502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.11 10:48:15, skipping insertion in model container
[2023-11-26 10:48:15,708 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2023-11-26 10:48:15,708 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:14" (2/3) ...
[2023-11-26 10:48:15,708 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@326d6502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.11 10:48:15, skipping insertion in model container
[2023-11-26 10:48:15,709 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2023-11-26 10:48:15,709 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:48:15" (3/3) ...
[2023-11-26 10:48:15,710 INFO  L332   chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c
[2023-11-26 10:48:15,773 INFO  L303   stractBuchiCegarLoop]: Interprodecural is true
[2023-11-26 10:48:15,774 INFO  L304   stractBuchiCegarLoop]: Hoare is false
[2023-11-26 10:48:15,774 INFO  L305   stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2023-11-26 10:48:15,774 INFO  L306   stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2023-11-26 10:48:15,774 INFO  L307   stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2023-11-26 10:48:15,774 INFO  L308   stractBuchiCegarLoop]: Difference is false
[2023-11-26 10:48:15,775 INFO  L309   stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2023-11-26 10:48:15,775 INFO  L313   stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ========
[2023-11-26 10:48:15,780 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 123 states, 122 states have (on average 1.7459016393442623) internal successors, (213), 122 states have internal predecessors, (213), 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-26 10:48:15,809 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 72
[2023-11-26 10:48:15,810 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2023-11-26 10:48:15,810 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2023-11-26 10:48:15,820 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-26 10:48:15,820 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 10:48:15,820 INFO  L335   stractBuchiCegarLoop]: ======== Iteration 1 ============
[2023-11-26 10:48:15,821 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 123 states, 122 states have (on average 1.7459016393442623) internal successors, (213), 122 states have internal predecessors, (213), 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-26 10:48:15,830 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 72
[2023-11-26 10:48:15,830 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2023-11-26 10:48:15,830 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2023-11-26 10:48:15,832 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-26 10:48:15,832 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 10:48:15,842 INFO  L748   eck$LassoCheckResult]: Stem: 29#$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(47, 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;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; 41#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~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~alive6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 72#L291true assume !(0 == (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296));init_~tmp~0#1 := 0; 49#L291-1true init_#res#1 := init_~tmp~0#1; 83#init_returnLabel#1true main_#t~ret35#1 := init_#res#1;havoc init_~tmp~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 42#L22true assume 0 == assume_abort_if_not_~cond#1;assume false; 89#L21true havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 19#L532-2true 
[2023-11-26 10:48:15,843 INFO  L750   eck$LassoCheckResult]: Loop: 19#L532-2true assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 107#L84true assume !(0 != ~mode1~0 % 256); 17#L105true assume 0 != ~alive1~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); 85#L108-2true ~mode1~0 := 1; 25#L84-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; 46#L122true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 79#L125true assume !(node2_~m2~0#1 != ~nomsg~0); 21#L125-1true ~mode2~0 := 0; 97#L122-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; 114#L156true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 69#L159true assume !(node3_~m3~0#1 != ~nomsg~0); 95#L159-1true ~mode3~0 := 0; 40#L156-2true havoc node3_~m3~0#1;assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 57#L190true assume !(0 != ~mode4~0 % 256); 67#L207true assume 0 != ~alive4~0 % 256;~p4_new~0 := (if (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 <= 127 then (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 else (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 - 256); 111#L210-2true ~mode4~0 := 1; 100#L190-2true havoc node4_~m4~0#1;assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 73#L224true assume !(0 != ~mode5~0 % 256); 27#L241true assume 0 != ~alive5~0 % 256;~p5_new~0 := (if (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 <= 127 then (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 else (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 - 256); 34#L244-2true ~mode5~0 := 1; 91#L224-2true havoc node5_~m5~0#1;assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 31#L258true assume !(0 != ~mode6~0 % 256); 99#L275true assume 0 != ~alive6~0 % 256;~p6_new~0 := (if (if ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0 then ~send6~0 else ~p6_new~0) % 256 <= 127 then (if ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0 then ~send6~0 else ~p6_new~0) % 256 else (if ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0 then ~send6~0 else ~p6_new~0) % 256 - 256); 3#L278-2true ~mode6~0 := 1; 68#L258-2true havoc node6_~m6~0#1;assume { :end_inline_node6 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 98#L464true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 32#L464-1true check_#res#1 := check_~tmp~1#1; 16#check_returnLabel#1true main_#t~ret36#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; 14#L564true assume !(0 == assert_~arg#1 % 256); 45#L559true havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true; 19#L532-2true 
[2023-11-26 10:48:15,850 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 10:48:15,850 INFO  L85        PathProgramCache]: Analyzing trace with hash 2035845626, now seen corresponding path program 1 times
[2023-11-26 10:48:15,861 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 10:48:15,861 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288009539]
[2023-11-26 10:48:15,862 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 10:48:15,862 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 10:48:15,980 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:48:16,046 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-26 10:48:16,047 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 10:48:16,047 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288009539]
[2023-11-26 10:48:16,048 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288009539] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 10:48:16,048 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 10:48:16,049 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-26 10:48:16,051 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663601643]
[2023-11-26 10:48:16,052 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 10:48:16,058 INFO  L753   eck$LassoCheckResult]: stem already infeasible
[2023-11-26 10:48:16,059 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 10:48:16,059 INFO  L85        PathProgramCache]: Analyzing trace with hash -1609030786, now seen corresponding path program 1 times
[2023-11-26 10:48:16,060 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 10:48:16,060 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865740481]
[2023-11-26 10:48:16,060 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 10:48:16,061 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 10:48:16,233 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:48:16,712 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-26 10:48:16,713 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 10:48:16,713 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865740481]
[2023-11-26 10:48:16,714 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865740481] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 10:48:16,714 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 10:48:16,714 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-26 10:48:16,714 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136648480]
[2023-11-26 10:48:16,714 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 10:48:16,716 INFO  L765   eck$LassoCheckResult]: loop already infeasible
[2023-11-26 10:48:16,717 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 10:48:16,748 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-26 10:48:16,749 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-26 10:48:16,752 INFO  L87              Difference]: Start difference. First operand  has 123 states, 122 states have (on average 1.7459016393442623) internal successors, (213), 122 states have internal predecessors, (213), 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 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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-26 10:48:16,769 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-26 10:48:16,769 INFO  L93              Difference]: Finished difference Result 118 states and 205 transitions.
[2023-11-26 10:48:16,771 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 205 transitions.
[2023-11-26 10:48:16,775 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 70
[2023-11-26 10:48:16,781 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 117 states and 204 transitions.
[2023-11-26 10:48:16,782 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 117
[2023-11-26 10:48:16,783 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 117
[2023-11-26 10:48:16,784 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 117 states and 204 transitions.
[2023-11-26 10:48:16,785 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 10:48:16,785 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 117 states and 204 transitions.
[2023-11-26 10:48:16,802 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 117 states and 204 transitions.
[2023-11-26 10:48:16,818 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117.
[2023-11-26 10:48:16,820 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 117 states, 117 states have (on average 1.7435897435897436) internal successors, (204), 116 states have internal predecessors, (204), 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-26 10:48:16,821 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 204 transitions.
[2023-11-26 10:48:16,823 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 117 states and 204 transitions.
[2023-11-26 10:48:16,823 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-26 10:48:16,827 INFO  L428   stractBuchiCegarLoop]: Abstraction has 117 states and 204 transitions.
[2023-11-26 10:48:16,828 INFO  L335   stractBuchiCegarLoop]: ======== Iteration 2 ============
[2023-11-26 10:48:16,828 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 204 transitions.
[2023-11-26 10:48:16,830 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 70
[2023-11-26 10:48:16,831 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2023-11-26 10:48:16,831 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2023-11-26 10:48:16,832 INFO  L148   hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-26 10:48:16,832 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 10:48:16,833 INFO  L748   eck$LassoCheckResult]: Stem: 301#$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(47, 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;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; 302#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~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~alive6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 318#L291 assume !(0 == (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296));init_~tmp~0#1 := 0; 258#L291-1 init_#res#1 := init_~tmp~0#1; 328#init_returnLabel#1 main_#t~ret35#1 := init_#res#1;havoc init_~tmp~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 319#L22 assume !(0 == assume_abort_if_not_~cond#1); 320#L21 havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 284#L532-2 
[2023-11-26 10:48:16,833 INFO  L750   eck$LassoCheckResult]: Loop: 284#L532-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 285#L84 assume !(0 != ~mode1~0 % 256); 279#L105 assume 0 != ~alive1~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); 280#L108-2 ~mode1~0 := 1; 294#L84-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; 295#L122 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 325#L125 assume !(node2_~m2~0#1 != ~nomsg~0); 288#L125-1 ~mode2~0 := 0; 289#L122-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; 362#L156 assume !(0 != ~mode3~0 % 256); 329#L173 assume 0 != ~alive3~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); 322#L176-2 ~mode3~0 := 1; 316#L156-2 havoc node3_~m3~0#1;assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 317#L190 assume !(0 != ~mode4~0 % 256); 336#L207 assume 0 != ~alive4~0 % 256;~p4_new~0 := (if (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 <= 127 then (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 else (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 - 256); 266#L210-2 ~mode4~0 := 1; 361#L190-2 havoc node4_~m4~0#1;assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 351#L224 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 352#L227 assume !(node5_~m5~0#1 != ~nomsg~0); 282#L227-1 ~mode5~0 := 0; 283#L224-2 havoc node5_~m5~0#1;assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 305#L258 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 306#L261 assume !(node6_~m6~0#1 != ~nomsg~0); 271#L261-1 ~mode6~0 := 0; 253#L258-2 havoc node6_~m6~0#1;assume { :end_inline_node6 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 346#L464 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 308#L464-1 check_#res#1 := check_~tmp~1#1; 278#check_returnLabel#1 main_#t~ret36#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; 275#L564 assume !(0 == assert_~arg#1 % 256); 276#L559 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true; 284#L532-2 
[2023-11-26 10:48:16,834 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 10:48:16,834 INFO  L85        PathProgramCache]: Analyzing trace with hash 2035845688, now seen corresponding path program 1 times
[2023-11-26 10:48:16,834 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 10:48:16,835 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467778537]
[2023-11-26 10:48:16,835 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 10:48:16,835 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 10:48:16,848 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:48:16,890 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-26 10:48:16,891 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 10:48:16,891 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467778537]
[2023-11-26 10:48:16,891 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467778537] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 10:48:16,891 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 10:48:16,892 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-26 10:48:16,892 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140505933]
[2023-11-26 10:48:16,892 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 10:48:16,892 INFO  L753   eck$LassoCheckResult]: stem already infeasible
[2023-11-26 10:48:16,893 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 10:48:16,893 INFO  L85        PathProgramCache]: Analyzing trace with hash 503354557, now seen corresponding path program 1 times
[2023-11-26 10:48:16,894 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 10:48:16,894 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876518453]
[2023-11-26 10:48:16,894 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 10:48:16,894 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 10:48:16,935 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:48:17,171 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-26 10:48:17,171 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 10:48:17,171 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876518453]
[2023-11-26 10:48:17,172 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876518453] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 10:48:17,172 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 10:48:17,173 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-26 10:48:17,173 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450706071]
[2023-11-26 10:48:17,173 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 10:48:17,174 INFO  L765   eck$LassoCheckResult]: loop already infeasible
[2023-11-26 10:48:17,175 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 10:48:17,176 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-26 10:48:17,177 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-11-26 10:48:17,177 INFO  L87              Difference]: Start difference. First operand 117 states and 204 transitions. cyclomatic complexity: 88 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-26 10:48:17,341 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-26 10:48:17,342 INFO  L93              Difference]: Finished difference Result 120 states and 206 transitions.
[2023-11-26 10:48:17,342 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 206 transitions.
[2023-11-26 10:48:17,348 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 70
[2023-11-26 10:48:17,350 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 117 states and 163 transitions.
[2023-11-26 10:48:17,350 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 117
[2023-11-26 10:48:17,351 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 117
[2023-11-26 10:48:17,351 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 117 states and 163 transitions.
[2023-11-26 10:48:17,352 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 10:48:17,352 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 117 states and 163 transitions.
[2023-11-26 10:48:17,353 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 117 states and 163 transitions.
[2023-11-26 10:48:17,359 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117.
[2023-11-26 10:48:17,360 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 117 states, 117 states have (on average 1.393162393162393) internal successors, (163), 116 states have internal predecessors, (163), 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-26 10:48:17,361 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 163 transitions.
[2023-11-26 10:48:17,362 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 117 states and 163 transitions.
[2023-11-26 10:48:17,362 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2023-11-26 10:48:17,363 INFO  L428   stractBuchiCegarLoop]: Abstraction has 117 states and 163 transitions.
[2023-11-26 10:48:17,363 INFO  L335   stractBuchiCegarLoop]: ======== Iteration 3 ============
[2023-11-26 10:48:17,364 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 163 transitions.
[2023-11-26 10:48:17,365 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 70
[2023-11-26 10:48:17,365 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2023-11-26 10:48:17,365 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2023-11-26 10:48:17,367 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 10:48:17,368 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 10:48:17,368 INFO  L748   eck$LassoCheckResult]: Stem: 553#$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(47, 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;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; 554#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~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~alive6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 570#L291 assume 0 == (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296); 602#L292 assume (if ~alive1~0 % 256 % 4294967296 <= 2147483647 then ~alive1~0 % 256 % 4294967296 else ~alive1~0 % 256 % 4294967296 - 4294967296) + (if ~alive2~0 % 256 % 4294967296 <= 2147483647 then ~alive2~0 % 256 % 4294967296 else ~alive2~0 % 256 % 4294967296 - 4294967296) + (if ~alive3~0 % 256 % 4294967296 <= 2147483647 then ~alive3~0 % 256 % 4294967296 else ~alive3~0 % 256 % 4294967296 - 4294967296) + (if ~alive4~0 % 256 % 4294967296 <= 2147483647 then ~alive4~0 % 256 % 4294967296 else ~alive4~0 % 256 % 4294967296 - 4294967296) + (if ~alive5~0 % 256 % 4294967296 <= 2147483647 then ~alive5~0 % 256 % 4294967296 else ~alive5~0 % 256 % 4294967296 - 4294967296) + (if ~alive6~0 % 256 % 4294967296 <= 2147483647 then ~alive6~0 % 256 % 4294967296 else ~alive6~0 % 256 % 4294967296 - 4294967296) >= 1; 610#L293 assume ~id1~0 >= 0; 617#L294 assume 0 == ~st1~0; 512#L295 assume ~send1~0 == ~id1~0; 513#L296 assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296); 561#L297 assume ~id2~0 >= 0; 555#L298 assume 0 == ~st2~0; 556#L299 assume ~send2~0 == ~id2~0; 567#L300 assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296); 593#L301 assume ~id3~0 >= 0; 606#L302 assume 0 == ~st3~0; 607#L303 assume ~send3~0 == ~id3~0; 612#L304 assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296); 589#L305 assume ~id4~0 >= 0; 590#L306 assume 0 == ~st4~0; 601#L307 assume ~send4~0 == ~id4~0; 520#L308 assume 0 == (if ~mode4~0 % 256 % 4294967296 <= 2147483647 then ~mode4~0 % 256 % 4294967296 else ~mode4~0 % 256 % 4294967296 - 4294967296); 521#L309 assume ~id5~0 >= 0; 597#L310 assume 0 == ~st5~0; 577#L311 assume ~send5~0 == ~id5~0; 578#L312 assume 0 == (if ~mode5~0 % 256 % 4294967296 <= 2147483647 then ~mode5~0 % 256 % 4294967296 else ~mode5~0 % 256 % 4294967296 - 4294967296); 544#L313 assume ~id6~0 >= 0; 545#L314 assume 0 == ~st6~0; 573#L315 assume ~send6~0 == ~id6~0; 574#L316 assume 0 == (if ~mode6~0 % 256 % 4294967296 <= 2147483647 then ~mode6~0 % 256 % 4294967296 else ~mode6~0 % 256 % 4294967296 - 4294967296); 510#L317 assume ~id1~0 != ~id2~0; 511#L318 assume ~id1~0 != ~id3~0; 619#L319 assume ~id1~0 != ~id4~0; 605#L320 assume ~id1~0 != ~id5~0; 591#L321 assume ~id1~0 != ~id6~0; 592#L322 assume ~id2~0 != ~id3~0; 506#L323 assume ~id2~0 != ~id4~0; 507#L324 assume ~id2~0 != ~id5~0; 529#L325 assume ~id2~0 != ~id6~0; 548#L326 assume ~id3~0 != ~id4~0; 536#L327 assume ~id3~0 != ~id5~0; 537#L328 assume ~id3~0 != ~id6~0; 562#L329 assume ~id4~0 != ~id5~0; 563#L330 assume ~id4~0 != ~id6~0; 518#L331 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 519#L291-1 init_#res#1 := init_~tmp~0#1; 580#init_returnLabel#1 main_#t~ret35#1 := init_#res#1;havoc init_~tmp~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 571#L22 assume !(0 == assume_abort_if_not_~cond#1); 572#L21 havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 538#L532-2 
[2023-11-26 10:48:17,369 INFO  L750   eck$LassoCheckResult]: Loop: 538#L532-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 539#L84 assume !(0 != ~mode1~0 % 256); 531#L105 assume 0 != ~alive1~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); 532#L108-2 ~mode1~0 := 1; 546#L84-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; 547#L122 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 579#L125 assume !(node2_~m2~0#1 != ~nomsg~0); 540#L125-1 ~mode2~0 := 0; 541#L122-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; 614#L156 assume !(0 != ~mode3~0 % 256); 581#L173 assume 0 != ~alive3~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); 576#L176-2 ~mode3~0 := 1; 568#L156-2 havoc node3_~m3~0#1;assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 569#L190 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 582#L193 assume !(node4_~m4~0#1 != ~nomsg~0); 584#L193-1 ~mode4~0 := 0; 613#L190-2 havoc node4_~m4~0#1;assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 603#L224 assume !(0 != ~mode5~0 % 256); 549#L241 assume 0 != ~alive5~0 % 256;~p5_new~0 := (if (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 <= 127 then (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 else (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 - 256); 515#L244-2 ~mode5~0 := 1; 535#L224-2 havoc node5_~m5~0#1;assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 557#L258 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 558#L261 assume !(node6_~m6~0#1 != ~nomsg~0); 523#L261-1 ~mode6~0 := 0; 505#L258-2 havoc node6_~m6~0#1;assume { :end_inline_node6 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 598#L464 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 560#L464-1 check_#res#1 := check_~tmp~1#1; 530#check_returnLabel#1 main_#t~ret36#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; 527#L564 assume !(0 == assert_~arg#1 % 256); 528#L559 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true; 538#L532-2 
[2023-11-26 10:48:17,370 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 10:48:17,370 INFO  L85        PathProgramCache]: Analyzing trace with hash -1766357374, now seen corresponding path program 1 times
[2023-11-26 10:48:17,371 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 10:48:17,371 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416380832]
[2023-11-26 10:48:17,371 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 10:48:17,371 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 10:48:17,399 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-26 10:48:17,399 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-26 10:48:17,438 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-26 10:48:17,491 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-26 10:48:17,492 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 10:48:17,492 INFO  L85        PathProgramCache]: Analyzing trace with hash 1802444093, now seen corresponding path program 1 times
[2023-11-26 10:48:17,492 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 10:48:17,493 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967084309]
[2023-11-26 10:48:17,493 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 10:48:17,493 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 10:48:17,535 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:48:17,727 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-26 10:48:17,727 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 10:48:17,728 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967084309]
[2023-11-26 10:48:17,728 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967084309] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 10:48:17,728 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 10:48:17,728 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-26 10:48:17,729 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644442019]
[2023-11-26 10:48:17,729 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 10:48:17,731 INFO  L765   eck$LassoCheckResult]: loop already infeasible
[2023-11-26 10:48:17,732 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 10:48:17,734 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-26 10:48:17,734 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-11-26 10:48:17,734 INFO  L87              Difference]: Start difference. First operand 117 states and 163 transitions. cyclomatic complexity: 47 Second operand  has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-26 10:48:17,792 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-26 10:48:17,792 INFO  L93              Difference]: Finished difference Result 120 states and 165 transitions.
[2023-11-26 10:48:17,792 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 165 transitions.
[2023-11-26 10:48:17,794 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 70
[2023-11-26 10:48:17,796 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 117 states and 161 transitions.
[2023-11-26 10:48:17,796 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 117
[2023-11-26 10:48:17,796 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 117
[2023-11-26 10:48:17,796 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 117 states and 161 transitions.
[2023-11-26 10:48:17,797 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 10:48:17,797 INFO  L218   hiAutomatonCegarLoop]: Abstraction has 117 states and 161 transitions.
[2023-11-26 10:48:17,798 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 117 states and 161 transitions.
[2023-11-26 10:48:17,804 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117.
[2023-11-26 10:48:17,804 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 117 states, 117 states have (on average 1.376068376068376) internal successors, (161), 116 states have internal predecessors, (161), 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-26 10:48:17,805 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 161 transitions.
[2023-11-26 10:48:17,805 INFO  L240   hiAutomatonCegarLoop]: Abstraction has 117 states and 161 transitions.
[2023-11-26 10:48:17,806 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2023-11-26 10:48:17,807 INFO  L428   stractBuchiCegarLoop]: Abstraction has 117 states and 161 transitions.
[2023-11-26 10:48:17,807 INFO  L335   stractBuchiCegarLoop]: ======== Iteration 4 ============
[2023-11-26 10:48:17,807 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 161 transitions.
[2023-11-26 10:48:17,808 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 70
[2023-11-26 10:48:17,808 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2023-11-26 10:48:17,808 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2023-11-26 10:48:17,811 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 10:48:17,811 INFO  L149   hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 10:48:17,811 INFO  L748   eck$LassoCheckResult]: Stem: 802#$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(47, 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;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; 803#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~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#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;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_#t~nondet34#1;~alive6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 819#L291 assume 0 == (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296); 851#L292 assume (if ~alive1~0 % 256 % 4294967296 <= 2147483647 then ~alive1~0 % 256 % 4294967296 else ~alive1~0 % 256 % 4294967296 - 4294967296) + (if ~alive2~0 % 256 % 4294967296 <= 2147483647 then ~alive2~0 % 256 % 4294967296 else ~alive2~0 % 256 % 4294967296 - 4294967296) + (if ~alive3~0 % 256 % 4294967296 <= 2147483647 then ~alive3~0 % 256 % 4294967296 else ~alive3~0 % 256 % 4294967296 - 4294967296) + (if ~alive4~0 % 256 % 4294967296 <= 2147483647 then ~alive4~0 % 256 % 4294967296 else ~alive4~0 % 256 % 4294967296 - 4294967296) + (if ~alive5~0 % 256 % 4294967296 <= 2147483647 then ~alive5~0 % 256 % 4294967296 else ~alive5~0 % 256 % 4294967296 - 4294967296) + (if ~alive6~0 % 256 % 4294967296 <= 2147483647 then ~alive6~0 % 256 % 4294967296 else ~alive6~0 % 256 % 4294967296 - 4294967296) >= 1; 859#L293 assume ~id1~0 >= 0; 866#L294 assume 0 == ~st1~0; 761#L295 assume ~send1~0 == ~id1~0; 762#L296 assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296); 810#L297 assume ~id2~0 >= 0; 804#L298 assume 0 == ~st2~0; 805#L299 assume ~send2~0 == ~id2~0; 816#L300 assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296); 842#L301 assume ~id3~0 >= 0; 855#L302 assume 0 == ~st3~0; 856#L303 assume ~send3~0 == ~id3~0; 861#L304 assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296); 838#L305 assume ~id4~0 >= 0; 839#L306 assume 0 == ~st4~0; 850#L307 assume ~send4~0 == ~id4~0; 769#L308 assume 0 == (if ~mode4~0 % 256 % 4294967296 <= 2147483647 then ~mode4~0 % 256 % 4294967296 else ~mode4~0 % 256 % 4294967296 - 4294967296); 770#L309 assume ~id5~0 >= 0; 846#L310 assume 0 == ~st5~0; 826#L311 assume ~send5~0 == ~id5~0; 827#L312 assume 0 == (if ~mode5~0 % 256 % 4294967296 <= 2147483647 then ~mode5~0 % 256 % 4294967296 else ~mode5~0 % 256 % 4294967296 - 4294967296); 793#L313 assume ~id6~0 >= 0; 794#L314 assume 0 == ~st6~0; 822#L315 assume ~send6~0 == ~id6~0; 823#L316 assume 0 == (if ~mode6~0 % 256 % 4294967296 <= 2147483647 then ~mode6~0 % 256 % 4294967296 else ~mode6~0 % 256 % 4294967296 - 4294967296); 759#L317 assume ~id1~0 != ~id2~0; 760#L318 assume ~id1~0 != ~id3~0; 868#L319 assume ~id1~0 != ~id4~0; 854#L320 assume ~id1~0 != ~id5~0; 840#L321 assume ~id1~0 != ~id6~0; 841#L322 assume ~id2~0 != ~id3~0; 755#L323 assume ~id2~0 != ~id4~0; 756#L324 assume ~id2~0 != ~id5~0; 778#L325 assume ~id2~0 != ~id6~0; 797#L326 assume ~id3~0 != ~id4~0; 785#L327 assume ~id3~0 != ~id5~0; 786#L328 assume ~id3~0 != ~id6~0; 811#L329 assume ~id4~0 != ~id5~0; 812#L330 assume ~id4~0 != ~id6~0; 767#L331 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 768#L291-1 init_#res#1 := init_~tmp~0#1; 829#init_returnLabel#1 main_#t~ret35#1 := init_#res#1;havoc init_~tmp~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 820#L22 assume !(0 == assume_abort_if_not_~cond#1); 821#L21 havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 787#L532-2 
[2023-11-26 10:48:17,812 INFO  L750   eck$LassoCheckResult]: Loop: 787#L532-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 788#L84 assume !(0 != ~mode1~0 % 256); 780#L105 assume 0 != ~alive1~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); 781#L108-2 ~mode1~0 := 1; 795#L84-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; 796#L122 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 828#L125 assume !(node2_~m2~0#1 != ~nomsg~0); 789#L125-1 ~mode2~0 := 0; 790#L122-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; 863#L156 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 848#L159 assume !(node3_~m3~0#1 != ~nomsg~0); 774#L159-1 ~mode3~0 := 0; 817#L156-2 havoc node3_~m3~0#1;assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 818#L190 assume !(0 != ~mode4~0 % 256); 837#L207 assume 0 != ~alive4~0 % 256;~p4_new~0 := (if (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 <= 127 then (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 else (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 - 256); 766#L210-2 ~mode4~0 := 1; 862#L190-2 havoc node4_~m4~0#1;assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 852#L224 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 853#L227 assume !(node5_~m5~0#1 != ~nomsg~0); 783#L227-1 ~mode5~0 := 0; 784#L224-2 havoc node5_~m5~0#1;assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 806#L258 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 807#L261 assume !(node6_~m6~0#1 != ~nomsg~0); 772#L261-1 ~mode6~0 := 0; 754#L258-2 havoc node6_~m6~0#1;assume { :end_inline_node6 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 847#L464 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 864#L465 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) < 6;check_~tmp~1#1 := 1; 809#L464-1 check_#res#1 := check_~tmp~1#1; 779#check_returnLabel#1 main_#t~ret36#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#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; 776#L564 assume !(0 == assert_~arg#1 % 256); 777#L559 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true; 787#L532-2 
[2023-11-26 10:48:17,812 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 10:48:17,813 INFO  L85        PathProgramCache]: Analyzing trace with hash -1766357374, now seen corresponding path program 2 times
[2023-11-26 10:48:17,813 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 10:48:17,813 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239637843]
[2023-11-26 10:48:17,813 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 10:48:17,813 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 10:48:17,834 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-26 10:48:17,835 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-26 10:48:17,850 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-26 10:48:17,866 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-26 10:48:17,867 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 10:48:17,867 INFO  L85        PathProgramCache]: Analyzing trace with hash -560235431, now seen corresponding path program 1 times
[2023-11-26 10:48:17,867 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 10:48:17,868 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889743489]
[2023-11-26 10:48:17,868 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 10:48:17,868 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 10:48:17,886 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-26 10:48:17,886 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-26 10:48:17,901 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-26 10:48:17,909 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-26 10:48:17,910 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 10:48:17,910 INFO  L85        PathProgramCache]: Analyzing trace with hash 314795448, now seen corresponding path program 1 times
[2023-11-26 10:48:17,910 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 10:48:17,910 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599652366]
[2023-11-26 10:48:17,910 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 10:48:17,911 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 10:48:17,935 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:48:18,017 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-26 10:48:18,017 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 10:48:18,017 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599652366]
[2023-11-26 10:48:18,018 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599652366] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 10:48:18,018 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 10:48:18,018 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-26 10:48:18,018 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744031982]
[2023-11-26 10:48:18,018 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 10:48:20,273 INFO  L210          LassoAnalysis]: Preferences:
[2023-11-26 10:48:20,273 INFO  L126   ssoRankerPreferences]: Compute integeral hull: false
[2023-11-26 10:48:20,273 INFO  L127   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2023-11-26 10:48:20,273 INFO  L128   ssoRankerPreferences]: Term annotations enabled: false
[2023-11-26 10:48:20,274 INFO  L129   ssoRankerPreferences]: Use exernal solver: true
[2023-11-26 10:48:20,274 INFO  L130   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-11-26 10:48:20,274 INFO  L131   ssoRankerPreferences]: Dump SMT script to file: false
[2023-11-26 10:48:20,274 INFO  L132   ssoRankerPreferences]: Path of dumped script: 
[2023-11-26 10:48:20,274 INFO  L133   ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_Iteration4_Loop
[2023-11-26 10:48:20,274 INFO  L134   ssoRankerPreferences]: MapElimAlgo: Frank
[2023-11-26 10:48:20,274 INFO  L276          LassoAnalysis]: Starting lasso preprocessing...
[2023-11-26 10:48:20,305 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-26 10:48:20,318 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-26 10:48:20,324 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-26 10:48:20,328 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-26 10:48:20,332 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-26 10:48:20,334 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-26 10:48:20,338 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-26 10:48:20,341 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-26 10:48:20,986 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-26 10:48:20,988 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-26 10:48:20,998 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-26 10:48:21,002 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-26 10:48:21,006 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-26 10:48:21,009 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-26 10:48:21,012 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-26 10:48:21,019 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-26 10:48:21,026 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-26 10:48:21,028 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-26 10:48:21,034 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-26 10:48:21,043 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-26 10:48:21,045 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-26 10:48:21,049 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-26 10:48:21,053 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-26 10:48:22,305 WARN  L137   XnfTransformerHelper]: expecting exponential blowup for input size 13
[2023-11-26 10:48:22,584 WARN  L176   XnfTransformerHelper]: Simplifying disjunction of 7676 conjunctions. This might take some time...
[2023-11-26 10:48:23,724 INFO  L192   XnfTransformerHelper]: Simplified to disjunction of 784 conjunctions. 
[2023-11-26 10:49:15,221 WARN  L293               SmtUtils]: Spent 51.39s on a formula simplification. DAG size of input: 909 DAG size of output: 161 (called from [L  68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process)
[2023-11-26 10:49:15,348 INFO  L294          LassoAnalysis]: Preprocessing complete.
[2023-11-26 10:49:15,348 INFO  L404          LassoAnalysis]: Checking for nontermination...
[2023-11-26 10:49:15,351 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-11-26 10:49:15,351 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f865e597-b461-4fd3-b79d-d822fa62499f/bin/uautomizer-verify-VRDe98Ueme/z3
[2023-11-26 10:49:15,360 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f865e597-b461-4fd3-b79d-d822fa62499f/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2023-11-26 10:49:15,373 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2023-11-26 10:49:15,373 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2023-11-26 10:49:15,386 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f865e597-b461-4fd3-b79d-d822fa62499f/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process
[2023-11-26 10:49:15,427 INFO  L540       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f865e597-b461-4fd3-b79d-d822fa62499f/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0
[2023-11-26 10:49:15,427 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-11-26 10:49:15,427 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f865e597-b461-4fd3-b79d-d822fa62499f/bin/uautomizer-verify-VRDe98Ueme/z3
[2023-11-26 10:49:15,429 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f865e597-b461-4fd3-b79d-d822fa62499f/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2023-11-26 10:49:15,436 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f865e597-b461-4fd3-b79d-d822fa62499f/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process
[2023-11-26 10:49:15,437 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2023-11-26 10:49:15,437 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2023-11-26 10:49:15,594 INFO  L444          LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists.
[2023-11-26 10:49:15,603 INFO  L540       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f865e597-b461-4fd3-b79d-d822fa62499f/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0
[2023-11-26 10:49:15,603 INFO  L210          LassoAnalysis]: Preferences:
[2023-11-26 10:49:15,603 INFO  L126   ssoRankerPreferences]: Compute integeral hull: false
[2023-11-26 10:49:15,603 INFO  L127   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2023-11-26 10:49:15,603 INFO  L128   ssoRankerPreferences]: Term annotations enabled: false
[2023-11-26 10:49:15,604 INFO  L129   ssoRankerPreferences]: Use exernal solver: false
[2023-11-26 10:49:15,604 INFO  L130   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2023-11-26 10:49:15,604 INFO  L131   ssoRankerPreferences]: Dump SMT script to file: false
[2023-11-26 10:49:15,604 INFO  L132   ssoRankerPreferences]: Path of dumped script: 
[2023-11-26 10:49:15,604 INFO  L133   ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c_Iteration4_Loop
[2023-11-26 10:49:15,604 INFO  L134   ssoRankerPreferences]: MapElimAlgo: Frank
[2023-11-26 10:49:15,604 INFO  L276          LassoAnalysis]: Starting lasso preprocessing...
[2023-11-26 10:49:15,620 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-26 10:49:15,624 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-26 10:49:15,633 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-26 10:49:15,639 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-26 10:49:15,644 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-26 10:49:15,647 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-26 10:49:15,650 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-26 10:49:15,653 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-26 10:49:15,660 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-26 10:49:15,664 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-26 10:49:15,668 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-26 10:49:15,671 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-26 10:49:15,679 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-26 10:49:15,684 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-26 10:49:15,687 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-26 10:49:15,693 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-26 10:49:15,700 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true