./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-pthread/cs_stateful-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e7bb482b 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_691bca65-b67f-401e-bd5c-36399ea3465c/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_691bca65-b67f-401e-bd5c-36399ea3465c/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_691bca65-b67f-401e-bd5c-36399ea3465c/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_691bca65-b67f-401e-bd5c-36399ea3465c/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-pthread/cs_stateful-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_691bca65-b67f-401e-bd5c-36399ea3465c/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_691bca65-b67f-401e-bd5c-36399ea3465c/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 8ecae2ca1de1e5b446d807037ed0cb2d4fc04c355acb35a6870f18f7e175f10e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:14:42,846 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:14:42,965 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_691bca65-b67f-401e-bd5c-36399ea3465c/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-06 21:14:42,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:14:42,974 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:14:43,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:14:43,014 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:14:43,015 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:14:43,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:14:43,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:14:43,021 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:14:43,022 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-06 21:14:43,022 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-06 21:14:43,024 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-06 21:14:43,024 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-06 21:14:43,025 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-06 21:14:43,025 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-06 21:14:43,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:14:43,026 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-06 21:14:43,027 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:14:43,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:14:43,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:14:43,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:14:43,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-06 21:14:43,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-06 21:14:43,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-06 21:14:43,031 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 21:14:43,032 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:14:43,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:14:43,032 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-06 21:14:43,034 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:14:43,034 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:14:43,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:14:43,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:14:43,035 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:14:43,036 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-06 21:14:43,036 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_691bca65-b67f-401e-bd5c-36399ea3465c/bin/uautomizer-verify-WvqO1wxjHP/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_691bca65-b67f-401e-bd5c-36399ea3465c/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 8ecae2ca1de1e5b446d807037ed0cb2d4fc04c355acb35a6870f18f7e175f10e [2023-11-06 21:14:43,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:14:43,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:14:43,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:14:43,375 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:14:43,376 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:14:43,377 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_691bca65-b67f-401e-bd5c-36399ea3465c/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/seq-pthread/cs_stateful-1.i [2023-11-06 21:14:46,566 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:14:46,915 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:14:46,924 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_691bca65-b67f-401e-bd5c-36399ea3465c/sv-benchmarks/c/seq-pthread/cs_stateful-1.i [2023-11-06 21:14:46,946 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_691bca65-b67f-401e-bd5c-36399ea3465c/bin/uautomizer-verify-WvqO1wxjHP/data/5de0d711f/d24a2ec0d04a4e7592f0d59a3c57ac9f/FLAG7d526e25b [2023-11-06 21:14:46,971 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_691bca65-b67f-401e-bd5c-36399ea3465c/bin/uautomizer-verify-WvqO1wxjHP/data/5de0d711f/d24a2ec0d04a4e7592f0d59a3c57ac9f [2023-11-06 21:14:46,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:14:46,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:14:46,983 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:14:46,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:14:46,990 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:14:46,991 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:14:46" (1/1) ... [2023-11-06 21:14:46,992 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c24dbc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:46, skipping insertion in model container [2023-11-06 21:14:46,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:14:46" (1/1) ... [2023-11-06 21:14:47,068 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:14:47,585 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:14:47,610 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:14:47,755 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:14:47,796 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:14:47,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:47 WrapperNode [2023-11-06 21:14:47,797 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:14:47,798 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:14:47,798 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:14:47,799 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:14:47,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:47" (1/1) ... [2023-11-06 21:14:47,834 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:47" (1/1) ... [2023-11-06 21:14:47,987 INFO L138 Inliner]: procedures = 144, calls = 232, calls flagged for inlining = 52, calls inlined = 142, statements flattened = 2463 [2023-11-06 21:14:47,988 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:14:47,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:14:47,989 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:14:47,989 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:14:48,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:47" (1/1) ... [2023-11-06 21:14:48,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:47" (1/1) ... [2023-11-06 21:14:48,062 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:47" (1/1) ... [2023-11-06 21:14:48,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:47" (1/1) ... [2023-11-06 21:14:48,149 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:47" (1/1) ... [2023-11-06 21:14:48,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:47" (1/1) ... [2023-11-06 21:14:48,194 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:47" (1/1) ... [2023-11-06 21:14:48,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:47" (1/1) ... [2023-11-06 21:14:48,239 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:14:48,241 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:14:48,241 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:14:48,241 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:14:48,242 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:47" (1/1) ... [2023-11-06 21:14:48,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:14:48,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_691bca65-b67f-401e-bd5c-36399ea3465c/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:14:48,277 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_691bca65-b67f-401e-bd5c-36399ea3465c/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:14:48,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_691bca65-b67f-401e-bd5c-36399ea3465c/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-06 21:14:48,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 21:14:48,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 21:14:48,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:14:48,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 21:14:48,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 21:14:48,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 21:14:48,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 21:14:48,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 21:14:48,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:14:48,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:14:48,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:14:48,554 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:14:48,557 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:14:48,656 WARN L818 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-06 21:14:48,658 WARN L818 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-06 21:14:48,728 WARN L818 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-06 21:14:48,730 WARN L818 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-06 21:14:48,756 WARN L818 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-06 21:14:48,758 WARN L818 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-06 21:14:51,779 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##305: assume !!((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2);~__CS_round~0 := (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296);havoc __CS_cs_#t~nondet4#1;~__CS_ret~0 := (if 0 != __CS_cs_#t~nondet4#1 && 1 == (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) then (if ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 else ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 - 4294967296) else (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));havoc __CS_cs_#t~nondet4#1; [2023-11-06 21:14:51,779 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##304: assume !((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2);assume false; [2023-11-06 21:14:51,786 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##309: assume !!((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2);~__CS_round~0 := (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296);havoc __CS_cs_#t~nondet4#1;~__CS_ret~0 := (if 0 != __CS_cs_#t~nondet4#1 && 1 == (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) then (if ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 else ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 - 4294967296) else (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));havoc __CS_cs_#t~nondet4#1; [2023-11-06 21:14:51,786 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##308: assume !((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2);assume false; [2023-11-06 21:14:51,786 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-10: havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;assume { :end_inline___CS_cs } true; [2023-11-06 21:14:51,787 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-11: havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;assume { :end_inline___CS_cs } true; [2023-11-06 21:14:51,787 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-12: havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;assume { :end_inline___CS_cs } true; [2023-11-06 21:14:51,787 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-38: havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;assume { :end_inline___CS_cs } true; [2023-11-06 21:14:51,787 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-39: havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;assume { :end_inline___CS_cs } true; [2023-11-06 21:14:51,788 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-40: havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;assume { :end_inline___CS_cs } true; [2023-11-06 21:14:51,788 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-66: havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;assume { :end_inline___CS_cs } true; [2023-11-06 21:14:51,789 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-67: havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;assume { :end_inline___CS_cs } true; [2023-11-06 21:14:51,789 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-68: havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;assume { :end_inline___CS_cs } true; [2023-11-06 21:14:51,789 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-30: assume !((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2);assume false; [2023-11-06 21:14:51,789 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-30: assume !!((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2); [2023-11-06 21:14:51,791 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-32: ~__CS_round~0 := (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296);havoc __CS_cs_#t~nondet4#1;~__CS_ret~0 := (if 0 != __CS_cs_#t~nondet4#1 && 1 == (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) then (if ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 else ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 - 4294967296) else (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));havoc __CS_cs_#t~nondet4#1; [2023-11-06 21:14:51,792 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-108: assume !((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2);assume false; [2023-11-06 21:14:51,792 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-108: assume !!((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2); [2023-11-06 21:14:51,793 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-110: ~__CS_round~0 := (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296);havoc __CS_cs_#t~nondet4#1;~__CS_ret~0 := (if 0 != __CS_cs_#t~nondet4#1 && 1 == (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) then (if ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 else ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 - 4294967296) else (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));havoc __CS_cs_#t~nondet4#1; [2023-11-06 21:14:51,793 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-186: assume !((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2);assume false; [2023-11-06 21:14:51,794 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-186: assume !!((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2); [2023-11-06 21:14:51,794 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-188: ~__CS_round~0 := (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296);havoc __CS_cs_#t~nondet4#1;~__CS_ret~0 := (if 0 != __CS_cs_#t~nondet4#1 && 1 == (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) then (if ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 else ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 - 4294967296) else (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));havoc __CS_cs_#t~nondet4#1; [2023-11-06 21:14:51,794 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##508: assume !((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2);assume false; [2023-11-06 21:14:51,794 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##509: assume !!((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2);~__CS_round~0 := (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296);havoc __CS_cs_#t~nondet4#1;~__CS_ret~0 := (if 0 != __CS_cs_#t~nondet4#1 && 1 == (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) then (if ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 else ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 - 4294967296) else (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));havoc __CS_cs_#t~nondet4#1; [2023-11-06 21:14:51,795 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##513: assume !!((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2);~__CS_round~0 := (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296);havoc __CS_cs_#t~nondet4#1;~__CS_ret~0 := (if 0 != __CS_cs_#t~nondet4#1 && 1 == (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) then (if ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 else ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 - 4294967296) else (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));havoc __CS_cs_#t~nondet4#1; [2023-11-06 21:14:51,795 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##512: assume !((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2);assume false; [2023-11-06 21:14:51,795 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L742: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2023-11-06 21:14:51,795 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L742: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-06 21:14:51,795 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-2: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2023-11-06 21:14:51,796 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-2: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-06 21:14:51,796 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-4: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2023-11-06 21:14:51,796 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-4: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-06 21:14:51,796 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L744: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2023-11-06 21:14:51,796 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L744: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));assume { :begin_inline___CS_cs } true;havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;havoc __CS_cs_#t~nondet3#1;__CS_cs_~k~0#1 := __CS_cs_#t~nondet3#1;havoc __CS_cs_#t~nondet3#1; [2023-11-06 21:14:51,797 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-2: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2023-11-06 21:14:51,797 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-2: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));assume { :begin_inline___CS_cs } true;havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;havoc __CS_cs_#t~nondet3#1;__CS_cs_~k~0#1 := __CS_cs_#t~nondet3#1;havoc __CS_cs_#t~nondet3#1; [2023-11-06 21:14:51,797 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-4: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2023-11-06 21:14:51,797 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-4: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));assume { :begin_inline___CS_cs } true;havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_~k~0#1;havoc __CS_cs_#t~nondet3#1;__CS_cs_~k~0#1 := __CS_cs_#t~nondet3#1;havoc __CS_cs_#t~nondet3#1; [2023-11-06 21:14:51,798 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L746: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2023-11-06 21:14:51,798 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L746: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-06 21:14:51,798 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-2: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2023-11-06 21:14:51,798 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-2: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-06 21:14:51,798 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-4: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2023-11-06 21:14:51,798 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-4: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-06 21:14:51,799 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##100: assume !((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2);assume false; [2023-11-06 21:14:51,799 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##104: assume !((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2);assume false; [2023-11-06 21:14:51,799 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##101: assume !!((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2);~__CS_round~0 := (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296);havoc __CS_cs_#t~nondet4#1;~__CS_ret~0 := (if 0 != __CS_cs_#t~nondet4#1 && 1 == (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) then (if ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 else ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 - 4294967296) else (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));havoc __CS_cs_#t~nondet4#1; [2023-11-06 21:14:51,799 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume !!((if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296) < 2);~__CS_round~0 := (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) + (if __CS_cs_~k~0#1 % 256 % 4294967296 <= 2147483647 then __CS_cs_~k~0#1 % 256 % 4294967296 else __CS_cs_~k~0#1 % 256 % 4294967296 - 4294967296);havoc __CS_cs_#t~nondet4#1;~__CS_ret~0 := (if 0 != __CS_cs_#t~nondet4#1 && 1 == (if ~__CS_round~0 % 256 % 4294967296 <= 2147483647 then ~__CS_round~0 % 256 % 4294967296 else ~__CS_round~0 % 256 % 4294967296 - 4294967296) then (if ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 else ~__CS_ret_PREEMPTED~0 % 256 % 4294967296 - 4294967296) else (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));havoc __CS_cs_#t~nondet4#1; [2023-11-06 21:14:51,799 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:14:51,821 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:14:51,821 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-06 21:14:51,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:51 BoogieIcfgContainer [2023-11-06 21:14:51,826 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:14:51,827 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-06 21:14:51,828 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-06 21:14:51,833 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-06 21:14:51,833 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-06 21:14:51,834 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.11 09:14:46" (1/3) ... [2023-11-06 21:14:51,835 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5155b2c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.11 09:14:51, skipping insertion in model container [2023-11-06 21:14:51,836 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-06 21:14:51,836 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:47" (2/3) ... [2023-11-06 21:14:51,838 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5155b2c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.11 09:14:51, skipping insertion in model container [2023-11-06 21:14:51,838 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-06 21:14:51,839 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:51" (3/3) ... [2023-11-06 21:14:51,841 INFO L332 chiAutomizerObserver]: Analyzing ICFG cs_stateful-1.i [2023-11-06 21:14:51,934 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-06 21:14:51,934 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-06 21:14:51,934 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-06 21:14:51,934 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-06 21:14:51,935 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-06 21:14:51,935 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-06 21:14:51,935 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-06 21:14:51,935 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-06 21:14:51,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 498 states, 497 states have (on average 1.4909456740442657) internal successors, (741), 497 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:52,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-06 21:14:52,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 21:14:52,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 21:14:52,017 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-06 21:14:52,018 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-06 21:14:52,018 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-06 21:14:52,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 498 states, 497 states have (on average 1.4909456740442657) internal successors, (741), 497 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:52,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-06 21:14:52,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 21:14:52,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 21:14:52,037 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-06 21:14:52,037 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-06 21:14:52,045 INFO L748 eck$LassoCheckResult]: Stem: 153#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet96#1, ULTIMATE.init_#t~nondet97#1, ULTIMATE.init_#t~nondet98#1, ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~__CS_round~0 := 0;~__CS_ret~0 := 0;~__CS_ret_PREEMPTED~0 := 1;~__CS_ret_ERROR~0 := 2;~__CS_ret_FINISHED~0 := 4;~__CS_error~0 := 0;~__CS_thread_index~0 := 0;~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := 3, 0;call #Ultimate.allocInit(3, 3);call write~init~int(0, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1);~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := 4, 0;call #Ultimate.allocInit(3, 4);call write~init~int(0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 1 + ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := 0], ~__CS_thread~0.offset[0 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[1 := 0], ~__CS_thread~0.offset[1 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[2 := 0], ~__CS_thread~0.offset[2 := 0];~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := 5, 0;call #Ultimate.allocInit(6, 5);call write~init~int(0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);~__THREAD_UNUSED~0 := 0;~__THREAD_RUNNING~0 := 1;~__THREAD_FINISHED~0 := 2;~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := 6, 0;call #Ultimate.allocInit(24, 6);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);~#ma~0.base, ~#ma~0.offset := 7, 0;call #Ultimate.allocInit(2, 7);call write~init~int(0, ~#ma~0.base, ~#ma~0.offset, 1);call write~init~int(0, ~#ma~0.base, 1 + ~#ma~0.offset, 1);~#mb~0.base, ~#mb~0.offset := 8, 0;call #Ultimate.allocInit(2, 8);call write~init~int(0, ~#mb~0.base, ~#mb~0.offset, 1);call write~init~int(0, ~#mb~0.base, 1 + ~#mb~0.offset, 1);~#data1~0.base, ~#data1~0.offset := 9, 0;call #Ultimate.allocInit(8, 9);call write~init~int(0, ~#data1~0.base, ~#data1~0.offset, 4);call write~init~int(0, ~#data1~0.base, 4 + ~#data1~0.offset, 4);~#data2~0.base, ~#data2~0.offset := 10, 0;call #Ultimate.allocInit(8, 10);call write~init~int(0, ~#data2~0.base, ~#data2~0.offset, 4);call write~init~int(0, ~#data2~0.base, 4 + ~#data2~0.offset, 4);~__CS_u~0.ma := ~__CS_u~0.ma[0 := 0];~__CS_u~0.ma := ~__CS_u~0.ma[1 := 0];~__CS_u~0.mb := ~__CS_u~0.mb[0 := ULTIMATE.init_#t~nondet96#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet97#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet98#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet99#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet101#1];havoc ULTIMATE.init_#t~nondet96#1;havoc ULTIMATE.init_#t~nondet97#1;havoc ULTIMATE.init_#t~nondet98#1;havoc ULTIMATE.init_#t~nondet99#1;havoc ULTIMATE.init_#t~nondet100#1;havoc ULTIMATE.init_#t~nondet101#1; 414#L-1true havoc ULTIMATE.init_#t~nondet96#1, ULTIMATE.init_#t~nondet97#1, ULTIMATE.init_#t~nondet98#1, ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~nondet49#1, main_#t~pre47#1, main_~j~2#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~pre46#1, main_~i~0#1, main_#t~mem54#1, main_#t~mem55#1, main_#t~mem56#1, main_#t~mem57#1.base, main_#t~mem57#1.offset, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~ret67#1.base, main_#t~ret67#1.offset, main_#t~mem68#1, main_#t~mem69#1, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1, main_#t~mem73#1, main_#t~ret75#1.base, main_#t~ret75#1.offset, main_#t~mem76#1, main_#t~mem77#1, main_#t~mem78#1, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~mem89#1, main_#t~mem90#1, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_#t~mem94#1, main_#t~mem95#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset, main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset;call main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset := #Ultimate.allocOnStack(6);call main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset := #Ultimate.allocOnStack(24);call main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset := #Ultimate.allocOnStack(8);main_~i~0#1 := 0; 181#L758-3true [2023-11-06 21:14:52,046 INFO L750 eck$LassoCheckResult]: Loop: 181#L758-3true assume !!(main_~i~0#1 < 2);main_~j~2#1 := 0; 175#L759-3true assume !(main_~j~2#1 < 3); 351#L759-4true havoc main_~j~2#1;havoc main_#t~nondet50#1;call write~int(main_#t~nondet50#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;call write~int(main_#t~nondet51#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;call write~int(main_#t~nondet52#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;call write~int(main_#t~nondet53#1, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1; 9#L758-2true main_#t~pre46#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre46#1; 181#L758-3true [2023-11-06 21:14:52,050 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:52,051 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-06 21:14:52,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:52,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053699778] [2023-11-06 21:14:52,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:52,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:14:52,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:14:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:14:52,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:14:52,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:52,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1237577, now seen corresponding path program 1 times [2023-11-06 21:14:52,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:52,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474017123] [2023-11-06 21:14:52,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:52,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:52,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:14:52,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:52,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474017123] [2023-11-06 21:14:52,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474017123] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:14:52,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:14:52,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:14:52,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885290822] [2023-11-06 21:14:52,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:14:52,610 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 21:14:52,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:52,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:14:52,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:14:52,665 INFO L87 Difference]: Start difference. First operand has 498 states, 497 states have (on average 1.4909456740442657) internal successors, (741), 497 states have internal predecessors, (741), 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 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:52,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:52,789 INFO L93 Difference]: Finished difference Result 499 states and 647 transitions. [2023-11-06 21:14:52,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 499 states and 647 transitions. [2023-11-06 21:14:52,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2023-11-06 21:14:52,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 499 states to 9 states and 10 transitions. [2023-11-06 21:14:52,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2023-11-06 21:14:52,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2023-11-06 21:14:52,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2023-11-06 21:14:52,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:14:52,811 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2023-11-06 21:14:52,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2023-11-06 21:14:52,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2023-11-06 21:14:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:52,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2023-11-06 21:14:52,842 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2023-11-06 21:14:52,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:14:52,848 INFO L428 stractBuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2023-11-06 21:14:52,849 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-06 21:14:52,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2023-11-06 21:14:52,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-11-06 21:14:52,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 21:14:52,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 21:14:52,855 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-06 21:14:52,855 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-11-06 21:14:52,855 INFO L748 eck$LassoCheckResult]: Stem: 1009#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet96#1, ULTIMATE.init_#t~nondet97#1, ULTIMATE.init_#t~nondet98#1, ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~__CS_round~0 := 0;~__CS_ret~0 := 0;~__CS_ret_PREEMPTED~0 := 1;~__CS_ret_ERROR~0 := 2;~__CS_ret_FINISHED~0 := 4;~__CS_error~0 := 0;~__CS_thread_index~0 := 0;~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := 3, 0;call #Ultimate.allocInit(3, 3);call write~init~int(0, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1);~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := 4, 0;call #Ultimate.allocInit(3, 4);call write~init~int(0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 1 + ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := 0], ~__CS_thread~0.offset[0 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[1 := 0], ~__CS_thread~0.offset[1 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[2 := 0], ~__CS_thread~0.offset[2 := 0];~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := 5, 0;call #Ultimate.allocInit(6, 5);call write~init~int(0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);~__THREAD_UNUSED~0 := 0;~__THREAD_RUNNING~0 := 1;~__THREAD_FINISHED~0 := 2;~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := 6, 0;call #Ultimate.allocInit(24, 6);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);~#ma~0.base, ~#ma~0.offset := 7, 0;call #Ultimate.allocInit(2, 7);call write~init~int(0, ~#ma~0.base, ~#ma~0.offset, 1);call write~init~int(0, ~#ma~0.base, 1 + ~#ma~0.offset, 1);~#mb~0.base, ~#mb~0.offset := 8, 0;call #Ultimate.allocInit(2, 8);call write~init~int(0, ~#mb~0.base, ~#mb~0.offset, 1);call write~init~int(0, ~#mb~0.base, 1 + ~#mb~0.offset, 1);~#data1~0.base, ~#data1~0.offset := 9, 0;call #Ultimate.allocInit(8, 9);call write~init~int(0, ~#data1~0.base, ~#data1~0.offset, 4);call write~init~int(0, ~#data1~0.base, 4 + ~#data1~0.offset, 4);~#data2~0.base, ~#data2~0.offset := 10, 0;call #Ultimate.allocInit(8, 10);call write~init~int(0, ~#data2~0.base, ~#data2~0.offset, 4);call write~init~int(0, ~#data2~0.base, 4 + ~#data2~0.offset, 4);~__CS_u~0.ma := ~__CS_u~0.ma[0 := 0];~__CS_u~0.ma := ~__CS_u~0.ma[1 := 0];~__CS_u~0.mb := ~__CS_u~0.mb[0 := ULTIMATE.init_#t~nondet96#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet97#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet98#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet99#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet101#1];havoc ULTIMATE.init_#t~nondet96#1;havoc ULTIMATE.init_#t~nondet97#1;havoc ULTIMATE.init_#t~nondet98#1;havoc ULTIMATE.init_#t~nondet99#1;havoc ULTIMATE.init_#t~nondet100#1;havoc ULTIMATE.init_#t~nondet101#1; 1010#L-1 havoc ULTIMATE.init_#t~nondet96#1, ULTIMATE.init_#t~nondet97#1, ULTIMATE.init_#t~nondet98#1, ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~nondet49#1, main_#t~pre47#1, main_~j~2#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~pre46#1, main_~i~0#1, main_#t~mem54#1, main_#t~mem55#1, main_#t~mem56#1, main_#t~mem57#1.base, main_#t~mem57#1.offset, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~ret67#1.base, main_#t~ret67#1.offset, main_#t~mem68#1, main_#t~mem69#1, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1, main_#t~mem73#1, main_#t~ret75#1.base, main_#t~ret75#1.offset, main_#t~mem76#1, main_#t~mem77#1, main_#t~mem78#1, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~mem89#1, main_#t~mem90#1, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_#t~mem94#1, main_#t~mem95#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset, main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset;call main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset := #Ultimate.allocOnStack(6);call main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset := #Ultimate.allocOnStack(24);call main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset := #Ultimate.allocOnStack(8);main_~i~0#1 := 0; 1012#L758-3 [2023-11-06 21:14:52,856 INFO L750 eck$LassoCheckResult]: Loop: 1012#L758-3 assume !!(main_~i~0#1 < 2);main_~j~2#1 := 0; 1006#L759-3 assume !!(main_~j~2#1 < 3);havoc main_#t~nondet48#1;call write~int(main_#t~nondet48#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet49#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet49#1 % 4294967296 % 4294967296 else main_#t~nondet49#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet49#1; 1007#L759-2 main_#t~pre47#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre47#1; 1008#L759-3 assume !(main_~j~2#1 < 3); 1013#L759-4 havoc main_~j~2#1;havoc main_#t~nondet50#1;call write~int(main_#t~nondet50#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;call write~int(main_#t~nondet51#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;call write~int(main_#t~nondet52#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;call write~int(main_#t~nondet53#1, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1; 1011#L758-2 main_#t~pre46#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre46#1; 1012#L758-3 [2023-11-06 21:14:52,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:52,858 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2023-11-06 21:14:52,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:52,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705151270] [2023-11-06 21:14:52,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:52,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:14:52,923 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:14:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:14:52,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:14:52,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:52,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1191030535, now seen corresponding path program 1 times [2023-11-06 21:14:52,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:52,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499949999] [2023-11-06 21:14:52,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:52,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:53,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:14:53,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:14:53,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499949999] [2023-11-06 21:14:53,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499949999] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:14:53,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594144168] [2023-11-06 21:14:53,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:53,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:14:53,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_691bca65-b67f-401e-bd5c-36399ea3465c/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:14:53,172 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_691bca65-b67f-401e-bd5c-36399ea3465c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:14:53,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_691bca65-b67f-401e-bd5c-36399ea3465c/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 21:14:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:14:53,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 21:14:53,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:14:53,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:14:53,439 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:14:53,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:14:53,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594144168] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:14:53,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:14:53,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-11-06 21:14:53,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345594576] [2023-11-06 21:14:53,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:14:53,463 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 21:14:53,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:14:53,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:14:53,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:14:53,466 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:53,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:14:53,530 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2023-11-06 21:14:53,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2023-11-06 21:14:53,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2023-11-06 21:14:53,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. [2023-11-06 21:14:53,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2023-11-06 21:14:53,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2023-11-06 21:14:53,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2023-11-06 21:14:53,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:14:53,531 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2023-11-06 21:14:53,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2023-11-06 21:14:53,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-11-06 21:14:53,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:14:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2023-11-06 21:14:53,533 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2023-11-06 21:14:53,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:14:53,540 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2023-11-06 21:14:53,540 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-06 21:14:53,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2023-11-06 21:14:53,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2023-11-06 21:14:53,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 21:14:53,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 21:14:53,541 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-06 21:14:53,541 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 1, 1, 1, 1] [2023-11-06 21:14:53,541 INFO L748 eck$LassoCheckResult]: Stem: 1067#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet96#1, ULTIMATE.init_#t~nondet97#1, ULTIMATE.init_#t~nondet98#1, ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~__CS_round~0 := 0;~__CS_ret~0 := 0;~__CS_ret_PREEMPTED~0 := 1;~__CS_ret_ERROR~0 := 2;~__CS_ret_FINISHED~0 := 4;~__CS_error~0 := 0;~__CS_thread_index~0 := 0;~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := 3, 0;call #Ultimate.allocInit(3, 3);call write~init~int(0, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1);~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := 4, 0;call #Ultimate.allocInit(3, 4);call write~init~int(0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 1 + ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := 0], ~__CS_thread~0.offset[0 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[1 := 0], ~__CS_thread~0.offset[1 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[2 := 0], ~__CS_thread~0.offset[2 := 0];~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := 5, 0;call #Ultimate.allocInit(6, 5);call write~init~int(0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);~__THREAD_UNUSED~0 := 0;~__THREAD_RUNNING~0 := 1;~__THREAD_FINISHED~0 := 2;~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := 6, 0;call #Ultimate.allocInit(24, 6);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);~#ma~0.base, ~#ma~0.offset := 7, 0;call #Ultimate.allocInit(2, 7);call write~init~int(0, ~#ma~0.base, ~#ma~0.offset, 1);call write~init~int(0, ~#ma~0.base, 1 + ~#ma~0.offset, 1);~#mb~0.base, ~#mb~0.offset := 8, 0;call #Ultimate.allocInit(2, 8);call write~init~int(0, ~#mb~0.base, ~#mb~0.offset, 1);call write~init~int(0, ~#mb~0.base, 1 + ~#mb~0.offset, 1);~#data1~0.base, ~#data1~0.offset := 9, 0;call #Ultimate.allocInit(8, 9);call write~init~int(0, ~#data1~0.base, ~#data1~0.offset, 4);call write~init~int(0, ~#data1~0.base, 4 + ~#data1~0.offset, 4);~#data2~0.base, ~#data2~0.offset := 10, 0;call #Ultimate.allocInit(8, 10);call write~init~int(0, ~#data2~0.base, ~#data2~0.offset, 4);call write~init~int(0, ~#data2~0.base, 4 + ~#data2~0.offset, 4);~__CS_u~0.ma := ~__CS_u~0.ma[0 := 0];~__CS_u~0.ma := ~__CS_u~0.ma[1 := 0];~__CS_u~0.mb := ~__CS_u~0.mb[0 := ULTIMATE.init_#t~nondet96#1];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet97#1];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet98#1];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet99#1];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet100#1];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet101#1];havoc ULTIMATE.init_#t~nondet96#1;havoc ULTIMATE.init_#t~nondet97#1;havoc ULTIMATE.init_#t~nondet98#1;havoc ULTIMATE.init_#t~nondet99#1;havoc ULTIMATE.init_#t~nondet100#1;havoc ULTIMATE.init_#t~nondet101#1; 1068#L-1 havoc ULTIMATE.init_#t~nondet96#1, ULTIMATE.init_#t~nondet97#1, ULTIMATE.init_#t~nondet98#1, ULTIMATE.init_#t~nondet99#1, ULTIMATE.init_#t~nondet100#1, ULTIMATE.init_#t~nondet101#1;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet48#1, main_#t~nondet49#1, main_#t~pre47#1, main_~j~2#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~pre46#1, main_~i~0#1, main_#t~mem54#1, main_#t~mem55#1, main_#t~mem56#1, main_#t~mem57#1.base, main_#t~mem57#1.offset, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~ret67#1.base, main_#t~ret67#1.offset, main_#t~mem68#1, main_#t~mem69#1, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1, main_#t~mem73#1, main_#t~ret75#1.base, main_#t~ret75#1.offset, main_#t~mem76#1, main_#t~mem77#1, main_#t~mem78#1, main_#t~mem79#1, main_#t~mem80#1, main_#t~mem81#1, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~mem89#1, main_#t~mem90#1, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_#t~mem94#1, main_#t~mem95#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset, main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset;call main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset := #Ultimate.allocOnStack(6);call main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset := #Ultimate.allocOnStack(24);call main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset := #Ultimate.allocOnStack(8);main_~i~0#1 := 0; 1070#L758-3 [2023-11-06 21:14:53,542 INFO L750 eck$LassoCheckResult]: Loop: 1070#L758-3 assume !!(main_~i~0#1 < 2);main_~j~2#1 := 0; 1064#L759-3 assume !!(main_~j~2#1 < 3);havoc main_#t~nondet48#1;call write~int(main_#t~nondet48#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet49#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet49#1 % 4294967296 % 4294967296 else main_#t~nondet49#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet49#1; 1065#L759-2 main_#t~pre47#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre47#1; 1066#L759-3 assume !!(main_~j~2#1 < 3);havoc main_#t~nondet48#1;call write~int(main_#t~nondet48#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet49#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet49#1 % 4294967296 % 4294967296 else main_#t~nondet49#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet49#1; 1075#L759-2 main_#t~pre47#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre47#1; 1074#L759-3 assume !!(main_~j~2#1 < 3);havoc main_#t~nondet48#1;call write~int(main_#t~nondet48#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset + 3 * main_~i~0#1 + main_~j~2#1, 1);havoc main_#t~nondet48#1;havoc main_#t~nondet49#1;call write~$Pointer$(0, (if main_#t~nondet49#1 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet49#1 % 4294967296 % 4294967296 else main_#t~nondet49#1 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset + 12 * main_~i~0#1 + 4 * main_~j~2#1, 4);havoc main_#t~nondet49#1; 1073#L759-2 main_#t~pre47#1 := 1 + main_~j~2#1;main_~j~2#1 := 1 + main_~j~2#1;havoc main_#t~pre47#1; 1072#L759-3 assume !(main_~j~2#1 < 3); 1071#L759-4 havoc main_~j~2#1;havoc main_#t~nondet50#1;call write~int(main_#t~nondet50#1, main_~#__CS_cp_ma~0#1.base, main_~#__CS_cp_ma~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet50#1;havoc main_#t~nondet51#1;call write~int(main_#t~nondet51#1, main_~#__CS_cp_mb~0#1.base, main_~#__CS_cp_mb~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;havoc main_#t~nondet52#1;call write~int(main_#t~nondet52#1, main_~#__CS_cp_data1~0#1.base, main_~#__CS_cp_data1~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet52#1;havoc main_#t~nondet53#1;call write~int(main_#t~nondet53#1, main_~#__CS_cp_data2~0#1.base, main_~#__CS_cp_data2~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet53#1; 1069#L758-2 main_#t~pre46#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre46#1; 1070#L758-3 [2023-11-06 21:14:53,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:53,542 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2023-11-06 21:14:53,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:53,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792444571] [2023-11-06 21:14:53,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:53,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:14:53,580 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:14:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:14:53,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:14:53,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:53,615 INFO L85 PathProgramCache]: Analyzing trace with hash -2055044605, now seen corresponding path program 2 times [2023-11-06 21:14:53,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:53,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029132097] [2023-11-06 21:14:53,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:53,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:53,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:14:53,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:14:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:14:53,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:14:53,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:14:53,779 INFO L85 PathProgramCache]: Analyzing trace with hash 149568325, now seen corresponding path program 1 times [2023-11-06 21:14:53,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:14:53,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960176874] [2023-11-06 21:14:53,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:14:53,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:14:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:14:53,968 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:14:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:14:54,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace