./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4fc63b2a 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_92ce41bf-2c11-4740-8b88-41e24ff5c035/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92ce41bf-2c11-4740-8b88-41e24ff5c035/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92ce41bf-2c11-4740-8b88-41e24ff5c035/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92ce41bf-2c11-4740-8b88-41e24ff5c035/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92ce41bf-2c11-4740-8b88-41e24ff5c035/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92ce41bf-2c11-4740-8b88-41e24ff5c035/bin/uautomizer-verify-4GaUIPS5ZU --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 8ec94212d42d56ec4ec8ccfb1876cba582c3e983611a6a88d38f3b3edc8b85b6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:19:21,644 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:19:21,749 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92ce41bf-2c11-4740-8b88-41e24ff5c035/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-31 22:19:21,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:19:21,759 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:19:21,794 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:19:21,795 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:19:21,795 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:19:21,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:19:21,801 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:19:21,802 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:19:21,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:19:21,802 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:19:21,803 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-31 22:19:21,803 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-31 22:19:21,803 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-31 22:19:21,803 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-31 22:19:21,806 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-31 22:19:21,806 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-31 22:19:21,806 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:19:21,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-31 22:19:21,807 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:19:21,808 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:19:21,808 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:19:21,808 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:19:21,809 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-31 22:19:21,809 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-31 22:19:21,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-31 22:19:21,810 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:19:21,810 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:19:21,810 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:19:21,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:19:21,811 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-31 22:19:21,811 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:19:21,812 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:19:21,812 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:19:21,813 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:19:21,813 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:19:21,814 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-31 22:19:21,814 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_92ce41bf-2c11-4740-8b88-41e24ff5c035/bin/uautomizer-verify-4GaUIPS5ZU/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_92ce41bf-2c11-4740-8b88-41e24ff5c035/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 8ec94212d42d56ec4ec8ccfb1876cba582c3e983611a6a88d38f3b3edc8b85b6 [2024-10-31 22:19:22,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:19:22,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:19:22,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:19:22,190 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:19:22,191 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:19:22,192 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92ce41bf-2c11-4740-8b88-41e24ff5c035/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c Unable to find full path for "g++" [2024-10-31 22:19:24,187 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:19:24,473 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:19:24,477 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92ce41bf-2c11-4740-8b88-41e24ff5c035/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2024-10-31 22:19:24,497 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92ce41bf-2c11-4740-8b88-41e24ff5c035/bin/uautomizer-verify-4GaUIPS5ZU/data/9e618b1cc/45ea6308f4b74539bceceb5a39daba80/FLAGdf615cecd [2024-10-31 22:19:24,517 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92ce41bf-2c11-4740-8b88-41e24ff5c035/bin/uautomizer-verify-4GaUIPS5ZU/data/9e618b1cc/45ea6308f4b74539bceceb5a39daba80 [2024-10-31 22:19:24,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:19:24,523 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:19:24,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:19:24,525 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:19:24,531 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:19:24,532 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:19:24" (1/1) ... [2024-10-31 22:19:24,533 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76086837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:24, skipping insertion in model container [2024-10-31 22:19:24,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:19:24" (1/1) ... [2024-10-31 22:19:24,583 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:19:24,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:19:24,888 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:19:24,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:19:24,984 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:19:24,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:24 WrapperNode [2024-10-31 22:19:24,985 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:19:24,986 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:19:24,986 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:19:24,987 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:19:24,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:24" (1/1) ... [2024-10-31 22:19:25,008 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:24" (1/1) ... [2024-10-31 22:19:25,055 INFO L138 Inliner]: procedures = 23, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 426 [2024-10-31 22:19:25,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:19:25,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:19:25,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:19:25,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:19:25,072 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:24" (1/1) ... [2024-10-31 22:19:25,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:24" (1/1) ... [2024-10-31 22:19:25,078 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:24" (1/1) ... [2024-10-31 22:19:25,094 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:19:25,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:24" (1/1) ... [2024-10-31 22:19:25,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:24" (1/1) ... [2024-10-31 22:19:25,104 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:24" (1/1) ... [2024-10-31 22:19:25,110 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:24" (1/1) ... [2024-10-31 22:19:25,116 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:24" (1/1) ... [2024-10-31 22:19:25,118 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:24" (1/1) ... [2024-10-31 22:19:25,125 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:19:25,127 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:19:25,127 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:19:25,127 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:19:25,128 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:24" (1/1) ... [2024-10-31 22:19:25,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:19:25,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92ce41bf-2c11-4740-8b88-41e24ff5c035/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:19:25,168 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92ce41bf-2c11-4740-8b88-41e24ff5c035/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:19:25,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92ce41bf-2c11-4740-8b88-41e24ff5c035/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-31 22:19:25,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:19:25,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:19:25,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:19:25,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:19:25,351 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:19:25,354 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:19:26,055 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-10-31 22:19:26,055 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:19:26,071 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:19:26,071 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:19:26,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:19:26 BoogieIcfgContainer [2024-10-31 22:19:26,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:19:26,073 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-31 22:19:26,073 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-31 22:19:26,078 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-31 22:19:26,079 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-31 22:19:26,079 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.10 10:19:24" (1/3) ... [2024-10-31 22:19:26,081 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a0fea7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.10 10:19:26, skipping insertion in model container [2024-10-31 22:19:26,081 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-31 22:19:26,082 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:24" (2/3) ... [2024-10-31 22:19:26,083 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a0fea7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.10 10:19:26, skipping insertion in model container [2024-10-31 22:19:26,084 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-31 22:19:26,084 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:19:26" (3/3) ... [2024-10-31 22:19:26,085 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2024-10-31 22:19:26,166 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-31 22:19:26,166 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-31 22:19:26,167 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-31 22:19:26,167 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-31 22:19:26,168 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-31 22:19:26,168 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-31 22:19:26,169 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-31 22:19:26,169 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-31 22:19:26,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 119 states, 118 states have (on average 1.7457627118644068) internal successors, (206), 118 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:26,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2024-10-31 22:19:26,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:19:26,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:19:26,217 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] [2024-10-31 22:19:26,217 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:26,217 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-31 22:19:26,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 119 states, 118 states have (on average 1.7457627118644068) internal successors, (206), 118 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:26,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2024-10-31 22:19:26,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:19:26,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:19:26,235 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] [2024-10-31 22:19:26,235 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:26,246 INFO L745 eck$LassoCheckResult]: Stem: 31#$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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 38#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~ret31#1, main_#t~ret32#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;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;assume 0 == main_#t~nondet23#1 || 1 == main_#t~nondet23#1;~mode2~0 := (if 0 == main_#t~nondet23#1 % 256 then 0 else 1);havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~mode3~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1); 29#L241true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 25#L244-1true init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1); 48#L254true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 51#L257-1true init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1); 23#L267true assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 11#L270-1true init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1); 90#L280true assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 70#L283-1true init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1); 106#L293true assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 69#L296-1true init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1); 114#L306true assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 16#L309-1true init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1); 120#L319true assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 96#L319-1true init_#res#1 := init_~tmp___5~0#1; 86#init_returnLabel#1true main_#t~ret31#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; 39#L22true assume !(0 == assume_abort_if_not_~cond#1); 92#L21true havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 18#L512-2true [2024-10-31 22:19:26,251 INFO L747 eck$LassoCheckResult]: Loop: 18#L512-2true assume !false;assume { :begin_inline_node1 } true; 49#L79true assume !(0 != ~mode1~0 % 256); 113#L107true assume !((if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) < 2); 107#L107-1true ~mode1~0 := 1; 37#L79-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true; 84#L125true assume !(0 != ~mode2~0 % 256); 7#L153true assume !((if ~r2~0 % 256 % 4294967296 <= 2147483647 then ~r2~0 % 256 % 4294967296 else ~r2~0 % 256 % 4294967296 - 4294967296) < 2); 81#L153-1true ~mode2~0 := 1; 73#L125-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true; 99#L171true assume !(0 != ~mode3~0 % 256); 44#L199true assume !((if ~r3~0 % 256 % 4294967296 <= 2147483647 then ~r3~0 % 256 % 4294967296 else ~r3~0 % 256 % 4294967296 - 4294967296) < 2); 119#L199-1true ~mode3~0 := 1; 77#L171-2true assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 53#L412true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 87#L412-1true check_#res#1 := check_~tmp~1#1; 14#check_returnLabel#1true main_#t~ret32#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret32#1;havoc main_#t~ret32#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; 76#L541true assume !(0 == assert_~arg#1 % 256); 64#L536true havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true; 18#L512-2true [2024-10-31 22:19:26,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:26,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1693212754, now seen corresponding path program 1 times [2024-10-31 22:19:26,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:26,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830778351] [2024-10-31 22:19:26,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:26,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:26,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:26,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:26,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830778351] [2024-10-31 22:19:26,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830778351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:26,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:26,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:19:26,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164621924] [2024-10-31 22:19:26,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:26,931 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-31 22:19:26,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:26,932 INFO L85 PathProgramCache]: Analyzing trace with hash -409676988, now seen corresponding path program 1 times [2024-10-31 22:19:26,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:26,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072806925] [2024-10-31 22:19:26,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:26,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:27,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:27,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:27,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072806925] [2024-10-31 22:19:27,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072806925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:27,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:27,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:19:27,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423603659] [2024-10-31 22:19:27,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:27,123 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:19:27,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:27,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:19:27,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:19:27,159 INFO L87 Difference]: Start difference. First operand has 119 states, 118 states have (on average 1.7457627118644068) internal successors, (206), 118 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:27,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:27,274 INFO L93 Difference]: Finished difference Result 117 states and 201 transitions. [2024-10-31 22:19:27,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 201 transitions. [2024-10-31 22:19:27,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2024-10-31 22:19:27,293 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 113 states and 189 transitions. [2024-10-31 22:19:27,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2024-10-31 22:19:27,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2024-10-31 22:19:27,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 189 transitions. [2024-10-31 22:19:27,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:19:27,296 INFO L218 hiAutomatonCegarLoop]: Abstraction has 113 states and 189 transitions. [2024-10-31 22:19:27,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 189 transitions. [2024-10-31 22:19:27,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-31 22:19:27,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 113 states have (on average 1.6725663716814159) internal successors, (189), 112 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:27,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 189 transitions. [2024-10-31 22:19:27,332 INFO L240 hiAutomatonCegarLoop]: Abstraction has 113 states and 189 transitions. [2024-10-31 22:19:27,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:19:27,337 INFO L425 stractBuchiCegarLoop]: Abstraction has 113 states and 189 transitions. [2024-10-31 22:19:27,338 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-31 22:19:27,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 189 transitions. [2024-10-31 22:19:27,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2024-10-31 22:19:27,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:19:27,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:19:27,341 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] [2024-10-31 22:19:27,342 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] [2024-10-31 22:19:27,342 INFO L745 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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~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~ret31#1, main_#t~ret32#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;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;assume 0 == main_#t~nondet23#1 || 1 == main_#t~nondet23#1;~mode2~0 := (if 0 == main_#t~nondet23#1 % 256 then 0 else 1);havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~mode3~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1); 298#L241 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 258#L244-1 init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1); 295#L254 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 304#L257-1 init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1); 291#L267 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 264#L270-1 init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1); 270#L280 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 339#L283-1 init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1); 348#L293 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 306#L296-1 init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1); 347#L306 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 277#L309-1 init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1); 278#L319 assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 252#L319-1 init_#res#1 := init_~tmp___5~0#1; 355#init_returnLabel#1 main_#t~ret31#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; 312#L22 assume !(0 == assume_abort_if_not_~cond#1); 313#L21 havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 280#L512-2 [2024-10-31 22:19:27,343 INFO L747 eck$LassoCheckResult]: Loop: 280#L512-2 assume !false;assume { :begin_inline_node1 } true; 281#L79 assume !(0 != ~mode1~0 % 256); 326#L107 assume !((if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) < 2); 357#L107-1 ~mode1~0 := 1; 310#L79-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true; 311#L125 assume !(0 != ~mode2~0 % 256); 260#L153 assume !((if ~r2~0 % 256 % 4294967296 <= 2147483647 then ~r2~0 % 256 % 4294967296 else ~r2~0 % 256 % 4294967296 - 4294967296) < 2); 261#L153-1 ~mode2~0 := 1; 256#L125-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true; 351#L171 assume !(0 != ~mode3~0 % 256); 318#L199 assume !((if ~r3~0 % 256 % 4294967296 <= 2147483647 then ~r3~0 % 256 % 4294967296 else ~r3~0 % 256 % 4294967296 - 4294967296) < 2); 320#L199-1 ~mode3~0 := 1; 337#L171-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 331#L412 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 332#L413 assume ~st1~0 + ~nl1~0 <= 1; 362#L414 assume ~st2~0 + ~nl2~0 <= 1; 360#L415 assume ~st3~0 + ~nl3~0 <= 1; 274#L416 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) >= 2; 254#$Ultimate##238 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) < 2; 316#$Ultimate##242 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) >= 2; 342#$Ultimate##246 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) < 2;check_~tmp~1#1 := 1; 273#L412-1 check_#res#1 := check_~tmp~1#1; 275#check_returnLabel#1 main_#t~ret32#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret32#1;havoc main_#t~ret32#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; 276#L541 assume !(0 == assert_~arg#1 % 256); 344#L536 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true; 280#L512-2 [2024-10-31 22:19:27,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:27,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1693212754, now seen corresponding path program 2 times [2024-10-31 22:19:27,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:27,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608645070] [2024-10-31 22:19:27,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:27,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:27,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:27,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:27,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608645070] [2024-10-31 22:19:27,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608645070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:27,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:27,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:19:27,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043560311] [2024-10-31 22:19:27,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:27,510 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-31 22:19:27,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:27,511 INFO L85 PathProgramCache]: Analyzing trace with hash -2071533962, now seen corresponding path program 1 times [2024-10-31 22:19:27,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:27,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245399977] [2024-10-31 22:19:27,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:27,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:27,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:27,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:27,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245399977] [2024-10-31 22:19:27,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245399977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:27,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:27,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:27,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470876033] [2024-10-31 22:19:27,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:27,557 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:19:27,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:27,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:19:27,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:19:27,558 INFO L87 Difference]: Start difference. First operand 113 states and 189 transitions. cyclomatic complexity: 77 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:27,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:27,648 INFO L93 Difference]: Finished difference Result 116 states and 191 transitions. [2024-10-31 22:19:27,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 191 transitions. [2024-10-31 22:19:27,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2024-10-31 22:19:27,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 113 states and 168 transitions. [2024-10-31 22:19:27,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2024-10-31 22:19:27,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2024-10-31 22:19:27,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 168 transitions. [2024-10-31 22:19:27,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:19:27,657 INFO L218 hiAutomatonCegarLoop]: Abstraction has 113 states and 168 transitions. [2024-10-31 22:19:27,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 168 transitions. [2024-10-31 22:19:27,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-31 22:19:27,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 113 states have (on average 1.4867256637168142) internal successors, (168), 112 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:27,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 168 transitions. [2024-10-31 22:19:27,663 INFO L240 hiAutomatonCegarLoop]: Abstraction has 113 states and 168 transitions. [2024-10-31 22:19:27,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:19:27,667 INFO L425 stractBuchiCegarLoop]: Abstraction has 113 states and 168 transitions. [2024-10-31 22:19:27,667 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-31 22:19:27,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 168 transitions. [2024-10-31 22:19:27,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2024-10-31 22:19:27,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:19:27,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:19:27,674 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] [2024-10-31 22:19:27,674 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] [2024-10-31 22:19:27,674 INFO L745 eck$LassoCheckResult]: Stem: 538#$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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 539#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~ret31#1, main_#t~ret32#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;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;assume 0 == main_#t~nondet23#1 || 1 == main_#t~nondet23#1;~mode2~0 := (if 0 == main_#t~nondet23#1 % 256 then 0 else 1);havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~mode3~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1); 535#L241 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 495#L244-1 init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1); 532#L254 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 541#L257-1 init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1); 528#L267 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 501#L270-1 init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1); 507#L280 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 576#L283-1 init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1); 585#L293 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 543#L296-1 init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1); 584#L306 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 514#L309-1 init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1); 515#L319 assume ~id1~0 != ~id2~0; 589#L320 assume ~id1~0 != ~id3~0; 577#L321 assume ~id2~0 != ~id3~0; 578#L322 assume ~id1~0 >= 0; 488#L323 assume ~id2~0 >= 0; 489#L324 assume ~id3~0 >= 0; 508#L325 assume 0 == (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296); 534#L326 assume 0 == (if ~r2~0 % 256 % 4294967296 <= 2147483647 then ~r2~0 % 256 % 4294967296 else ~r2~0 % 256 % 4294967296 - 4294967296); 517#L327 assume 0 == (if ~r3~0 % 256 % 4294967296 <= 2147483647 then ~r3~0 % 256 % 4294967296 else ~r3~0 % 256 % 4294967296 - 4294967296); 518#L328 assume ~max1~0 == ~id1~0; 545#L329 assume ~max2~0 == ~id2~0; 546#L330 assume ~max3~0 == ~id3~0; 505#L331 assume 0 == ~st1~0; 506#L332 assume 0 == ~st2~0; 533#L333 assume 0 == ~st3~0; 544#L334 assume 0 == ~nl1~0; 523#L335 assume 0 == ~nl2~0; 524#L336 assume 0 == ~nl3~0; 587#L337 assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296); 558#L338 assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296); 559#L339 assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296);init_~tmp___5~0#1 := 1; 596#L319-1 init_#res#1 := init_~tmp___5~0#1; 592#init_returnLabel#1 main_#t~ret31#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; 549#L22 assume !(0 == assume_abort_if_not_~cond#1); 550#L21 havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 519#L512-2 [2024-10-31 22:19:27,675 INFO L747 eck$LassoCheckResult]: Loop: 519#L512-2 assume !false;assume { :begin_inline_node1 } true; 520#L79 assume !(0 != ~mode1~0 % 256); 563#L107 assume !((if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) < 2); 594#L107-1 ~mode1~0 := 1; 547#L79-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true; 548#L125 assume !(0 != ~mode2~0 % 256); 497#L153 assume !((if ~r2~0 % 256 % 4294967296 <= 2147483647 then ~r2~0 % 256 % 4294967296 else ~r2~0 % 256 % 4294967296 - 4294967296) < 2); 498#L153-1 ~mode2~0 := 1; 493#L125-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true; 588#L171 assume !(0 != ~mode3~0 % 256); 555#L199 assume !((if ~r3~0 % 256 % 4294967296 <= 2147483647 then ~r3~0 % 256 % 4294967296 else ~r3~0 % 256 % 4294967296 - 4294967296) < 2); 557#L199-1 ~mode3~0 := 1; 574#L171-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 568#L412 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 569#L413 assume ~st1~0 + ~nl1~0 <= 1; 600#L414 assume ~st2~0 + ~nl2~0 <= 1; 598#L415 assume ~st3~0 + ~nl3~0 <= 1; 511#L416 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) >= 2; 491#$Ultimate##238 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) < 2; 553#$Ultimate##242 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) >= 2; 579#$Ultimate##246 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) < 2;check_~tmp~1#1 := 1; 510#L412-1 check_#res#1 := check_~tmp~1#1; 512#check_returnLabel#1 main_#t~ret32#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret32#1;havoc main_#t~ret32#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; 513#L541 assume !(0 == assert_~arg#1 % 256); 581#L536 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true; 519#L512-2 [2024-10-31 22:19:27,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:27,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1849055478, now seen corresponding path program 1 times [2024-10-31 22:19:27,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:27,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197418078] [2024-10-31 22:19:27,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:27,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:19:27,805 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:19:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:19:27,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:19:27,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:27,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2071533962, now seen corresponding path program 2 times [2024-10-31 22:19:27,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:27,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294739694] [2024-10-31 22:19:27,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:27,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:27,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:28,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:28,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:28,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294739694] [2024-10-31 22:19:28,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294739694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:28,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:28,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:28,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490273936] [2024-10-31 22:19:28,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:28,042 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:19:28,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:28,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:28,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:28,045 INFO L87 Difference]: Start difference. First operand 113 states and 168 transitions. cyclomatic complexity: 56 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:28,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:28,124 INFO L93 Difference]: Finished difference Result 163 states and 242 transitions. [2024-10-31 22:19:28,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 163 states and 242 transitions. [2024-10-31 22:19:28,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 112 [2024-10-31 22:19:28,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 163 states to 163 states and 242 transitions. [2024-10-31 22:19:28,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 163 [2024-10-31 22:19:28,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 163 [2024-10-31 22:19:28,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 163 states and 242 transitions. [2024-10-31 22:19:28,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:19:28,130 INFO L218 hiAutomatonCegarLoop]: Abstraction has 163 states and 242 transitions. [2024-10-31 22:19:28,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states and 242 transitions. [2024-10-31 22:19:28,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2024-10-31 22:19:28,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 161 states have (on average 1.484472049689441) internal successors, (239), 160 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:28,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 239 transitions. [2024-10-31 22:19:28,139 INFO L240 hiAutomatonCegarLoop]: Abstraction has 161 states and 239 transitions. [2024-10-31 22:19:28,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:28,140 INFO L425 stractBuchiCegarLoop]: Abstraction has 161 states and 239 transitions. [2024-10-31 22:19:28,140 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-31 22:19:28,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 161 states and 239 transitions. [2024-10-31 22:19:28,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 110 [2024-10-31 22:19:28,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:19:28,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:19:28,143 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] [2024-10-31 22:19:28,143 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] [2024-10-31 22:19:28,144 INFO L745 eck$LassoCheckResult]: Stem: 821#$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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 822#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~ret31#1, main_#t~ret32#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;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;assume 0 == main_#t~nondet23#1 || 1 == main_#t~nondet23#1;~mode2~0 := (if 0 == main_#t~nondet23#1 % 256 then 0 else 1);havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~mode3~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1); 818#L241 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 777#L244-1 init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1); 815#L254 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 824#L257-1 init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1); 811#L267 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 783#L270-1 init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1); 789#L280 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 858#L283-1 init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1); 868#L293 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 826#L296-1 init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1); 867#L306 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 797#L309-1 init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1); 798#L319 assume ~id1~0 != ~id2~0; 874#L320 assume ~id1~0 != ~id3~0; 859#L321 assume ~id2~0 != ~id3~0; 860#L322 assume ~id1~0 >= 0; 770#L323 assume ~id2~0 >= 0; 771#L324 assume ~id3~0 >= 0; 790#L325 assume 0 == (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296); 817#L326 assume 0 == (if ~r2~0 % 256 % 4294967296 <= 2147483647 then ~r2~0 % 256 % 4294967296 else ~r2~0 % 256 % 4294967296 - 4294967296); 800#L327 assume 0 == (if ~r3~0 % 256 % 4294967296 <= 2147483647 then ~r3~0 % 256 % 4294967296 else ~r3~0 % 256 % 4294967296 - 4294967296); 801#L328 assume ~max1~0 == ~id1~0; 828#L329 assume ~max2~0 == ~id2~0; 829#L330 assume ~max3~0 == ~id3~0; 787#L331 assume 0 == ~st1~0; 788#L332 assume 0 == ~st2~0; 816#L333 assume 0 == ~st3~0; 827#L334 assume 0 == ~nl1~0; 806#L335 assume 0 == ~nl2~0; 807#L336 assume 0 == ~nl3~0; 870#L337 assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296); 840#L338 assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296); 841#L339 assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296);init_~tmp___5~0#1 := 1; 881#L319-1 init_#res#1 := init_~tmp___5~0#1; 877#init_returnLabel#1 main_#t~ret31#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; 832#L22 assume !(0 == assume_abort_if_not_~cond#1); 833#L21 havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 802#L512-2 [2024-10-31 22:19:28,144 INFO L747 eck$LassoCheckResult]: Loop: 802#L512-2 assume !false;assume { :begin_inline_node1 } true; 803#L79 assume !(0 != ~mode1~0 % 256); 845#L107 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) < 2; 804#L108 assume 0 != ~ep12~0 % 256;~p12_new~0 := (if (if ~max1~0 != ~nomsg~0 && ~p12_new~0 == ~nomsg~0 then ~max1~0 else ~p12_new~0) % 256 <= 127 then (if ~max1~0 != ~nomsg~0 && ~p12_new~0 == ~nomsg~0 then ~max1~0 else ~p12_new~0) % 256 else (if ~max1~0 != ~nomsg~0 && ~p12_new~0 == ~nomsg~0 then ~max1~0 else ~p12_new~0) % 256 - 256); 805#L108-2 assume 0 != ~ep13~0 % 256;~p13_new~0 := (if (if ~max1~0 != ~nomsg~0 && ~p13_new~0 == ~nomsg~0 then ~max1~0 else ~p13_new~0) % 256 <= 127 then (if ~max1~0 != ~nomsg~0 && ~p13_new~0 == ~nomsg~0 then ~max1~0 else ~p13_new~0) % 256 else (if ~max1~0 != ~nomsg~0 && ~p13_new~0 == ~nomsg~0 then ~max1~0 else ~p13_new~0) % 256 - 256); 879#L107-1 ~mode1~0 := 1; 830#L79-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true; 831#L125 assume !(0 != ~mode2~0 % 256); 779#L153 assume !((if ~r2~0 % 256 % 4294967296 <= 2147483647 then ~r2~0 % 256 % 4294967296 else ~r2~0 % 256 % 4294967296 - 4294967296) < 2); 780#L153-1 ~mode2~0 := 1; 775#L125-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true; 871#L171 assume !(0 != ~mode3~0 % 256); 907#L199 assume !((if ~r3~0 % 256 % 4294967296 <= 2147483647 then ~r3~0 % 256 % 4294967296 else ~r3~0 % 256 % 4294967296 - 4294967296) < 2); 902#L199-1 ~mode3~0 := 1; 897#L171-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 895#L412 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 894#L413 assume ~st1~0 + ~nl1~0 <= 1; 887#L414 assume ~st2~0 + ~nl2~0 <= 1; 888#L415 assume ~st3~0 + ~nl3~0 <= 1; 892#L416 assume !((if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) >= 2); 772#L419 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 773#$Ultimate##238 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) < 2; 893#$Ultimate##242 assume !((if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) >= 2); 872#L429 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 873#$Ultimate##246 assume (if ~r1~0 % 256 % 4294967296 <= 2147483647 then ~r1~0 % 256 % 4294967296 else ~r1~0 % 256 % 4294967296 - 4294967296) < 2;check_~tmp~1#1 := 1; 901#L412-1 check_#res#1 := check_~tmp~1#1; 900#check_returnLabel#1 main_#t~ret32#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret32#1;havoc main_#t~ret32#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; 899#L541 assume !(0 == assert_~arg#1 % 256); 898#L536 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true; 802#L512-2 [2024-10-31 22:19:28,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:28,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1849055478, now seen corresponding path program 2 times [2024-10-31 22:19:28,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:28,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175732430] [2024-10-31 22:19:28,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:28,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:19:28,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:19:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:19:28,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:19:28,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:28,343 INFO L85 PathProgramCache]: Analyzing trace with hash 170677582, now seen corresponding path program 1 times [2024-10-31 22:19:28,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:28,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655172155] [2024-10-31 22:19:28,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:28,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:19:28,360 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:19:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:19:28,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:19:28,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:28,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1879753607, now seen corresponding path program 1 times [2024-10-31 22:19:28,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:28,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889871635] [2024-10-31 22:19:28,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:28,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:28,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:28,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:28,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889871635] [2024-10-31 22:19:28,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889871635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:28,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:28,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:28,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88282284] [2024-10-31 22:19:28,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:30,729 INFO L204 LassoAnalysis]: Preferences: [2024-10-31 22:19:30,730 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-31 22:19:30,730 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-31 22:19:30,730 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-31 22:19:30,731 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-31 22:19:30,731 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:19:30,731 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-31 22:19:30,731 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-31 22:19:30,731 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3.1.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2024-10-31 22:19:30,732 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-31 22:19:30,732 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-31 22:19:30,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:19:30,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:19:30,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:19:30,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:19:30,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:19:30,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:19:30,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:19:30,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:19:30,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:19:30,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:19:31,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:19:31,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:19:31,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:19:31,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:19:31,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-31 22:19:32,766 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2024-10-31 22:19:33,067 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 10533 conjunctions. This might take some time... [2024-10-31 22:19:34,520 INFO L192 XnfTransformerHelper]: Simplified to disjunction of 723 conjunctions.