./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10aecdd717bb6691571ad1da0b912f030832fb85361f767ea82293acfe046216 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 23:38:10,237 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 23:38:10,332 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-13 23:38:10,337 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 23:38:10,337 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 23:38:10,361 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 23:38:10,361 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 23:38:10,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 23:38:10,362 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 23:38:10,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 23:38:10,362 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-13 23:38:10,363 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-13 23:38:10,363 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-13 23:38:10,363 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-13 23:38:10,363 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-13 23:38:10,363 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-13 23:38:10,363 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-13 23:38:10,363 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-13 23:38:10,364 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-13 23:38:10,364 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-13 23:38:10,364 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-13 23:38:10,364 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-13 23:38:10,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 23:38:10,365 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 23:38:10,365 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 23:38:10,365 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 23:38:10,367 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 23:38:10,367 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 23:38:10,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 23:38:10,368 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 23:38:10,368 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 23:38:10,368 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 23:38:10,368 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 23:38:10,368 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 23:38:10,368 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 23:38:10,368 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 23:38:10,368 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 23:38:10,369 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 23:38:10,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:38:10,369 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 23:38:10,369 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 23:38:10,369 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 23:38:10,369 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-13 23:38:10,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 23:38:10,369 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 23:38:10,369 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-13 23:38:10,369 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 23:38:10,370 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 10aecdd717bb6691571ad1da0b912f030832fb85361f767ea82293acfe046216 [2024-11-13 23:38:10,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 23:38:10,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 23:38:10,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 23:38:10,692 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 23:38:10,692 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 23:38:10,694 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i Unable to find full path for "g++" [2024-11-13 23:38:12,680 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 23:38:13,108 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 23:38:13,109 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i [2024-11-13 23:38:13,124 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/data/d63a6c3dc/ded4e1cacd7046e28913882dce699d2f/FLAG121278636 [2024-11-13 23:38:13,279 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/data/d63a6c3dc/ded4e1cacd7046e28913882dce699d2f [2024-11-13 23:38:13,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 23:38:13,284 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 23:38:13,286 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 23:38:13,286 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 23:38:13,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 23:38:13,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:38:13" (1/1) ... [2024-11-13 23:38:13,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@414741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:38:13, skipping insertion in model container [2024-11-13 23:38:13,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:38:13" (1/1) ... [2024-11-13 23:38:13,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 23:38:13,786 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26271,26284] [2024-11-13 23:38:13,791 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26396,26409] [2024-11-13 23:38:13,794 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26511,26524] [2024-11-13 23:38:13,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:38:13,831 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 23:38:13,882 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26271,26284] [2024-11-13 23:38:13,883 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26396,26409] [2024-11-13 23:38:13,884 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26511,26524] [2024-11-13 23:38:13,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:38:13,926 INFO L204 MainTranslator]: Completed translation [2024-11-13 23:38:13,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:38:13 WrapperNode [2024-11-13 23:38:13,929 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 23:38:13,930 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 23:38:13,930 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 23:38:13,930 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 23:38:13,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:38:13" (1/1) ... [2024-11-13 23:38:13,952 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:38:13" (1/1) ... [2024-11-13 23:38:13,990 INFO L138 Inliner]: procedures = 142, calls = 62, calls flagged for inlining = 15, calls inlined = 14, statements flattened = 182 [2024-11-13 23:38:13,991 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 23:38:13,991 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 23:38:13,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 23:38:13,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 23:38:14,001 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:38:13" (1/1) ... [2024-11-13 23:38:14,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:38:13" (1/1) ... [2024-11-13 23:38:14,012 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:38:13" (1/1) ... [2024-11-13 23:38:14,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:38:13" (1/1) ... [2024-11-13 23:38:14,027 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:38:13" (1/1) ... [2024-11-13 23:38:14,031 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:38:13" (1/1) ... [2024-11-13 23:38:14,033 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:38:13" (1/1) ... [2024-11-13 23:38:14,035 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:38:13" (1/1) ... [2024-11-13 23:38:14,038 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 23:38:14,039 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 23:38:14,040 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 23:38:14,040 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 23:38:14,041 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:38:13" (1/1) ... [2024-11-13 23:38:14,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:38:14,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:38:14,081 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 23:38:14,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 23:38:14,119 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-11-13 23:38:14,119 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-11-13 23:38:14,119 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2024-11-13 23:38:14,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2024-11-13 23:38:14,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 23:38:14,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 23:38:14,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-13 23:38:14,120 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2024-11-13 23:38:14,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2024-11-13 23:38:14,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-13 23:38:14,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 23:38:14,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-13 23:38:14,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 23:38:14,120 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2024-11-13 23:38:14,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2024-11-13 23:38:14,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 23:38:14,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 23:38:14,305 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 23:38:14,307 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 23:38:14,724 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-13 23:38:14,725 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 23:38:14,878 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 23:38:14,878 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-13 23:38:14,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:38:14 BoogieIcfgContainer [2024-11-13 23:38:14,878 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 23:38:14,881 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 23:38:14,883 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 23:38:14,888 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 23:38:14,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 11:38:13" (1/3) ... [2024-11-13 23:38:14,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7965e0e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:38:14, skipping insertion in model container [2024-11-13 23:38:14,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:38:13" (2/3) ... [2024-11-13 23:38:14,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7965e0e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:38:14, skipping insertion in model container [2024-11-13 23:38:14,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:38:14" (3/3) ... [2024-11-13 23:38:14,892 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_unbounded-1.i [2024-11-13 23:38:14,909 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 23:38:14,911 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG test_mutex_unbounded-1.i that has 5 procedures, 47 locations, 1 initial locations, 5 loop locations, and 3 error locations. [2024-11-13 23:38:14,976 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 23:38:14,987 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@60c3b534, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 23:38:14,987 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-13 23:38:14,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 34 states have internal predecessors, (44), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-13 23:38:14,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 23:38:14,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:38:14,999 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 23:38:14,999 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:38:15,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:38:15,003 INFO L85 PathProgramCache]: Analyzing trace with hash 2080789988, now seen corresponding path program 1 times [2024-11-13 23:38:15,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:38:15,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504883431] [2024-11-13 23:38:15,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:38:15,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:38:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:38:15,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:38:15,410 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:38:15,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504883431] [2024-11-13 23:38:15,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504883431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:38:15,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:38:15,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 23:38:15,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524871068] [2024-11-13 23:38:15,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:38:15,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:38:15,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:38:15,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:38:15,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:38:15,449 INFO L87 Difference]: Start difference. First operand has 47 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 34 states have internal predecessors, (44), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:38:15,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:38:15,718 INFO L93 Difference]: Finished difference Result 126 states and 163 transitions. [2024-11-13 23:38:15,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:38:15,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2024-11-13 23:38:15,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:38:15,729 INFO L225 Difference]: With dead ends: 126 [2024-11-13 23:38:15,730 INFO L226 Difference]: Without dead ends: 80 [2024-11-13 23:38:15,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:38:15,737 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 42 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:38:15,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 101 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:38:15,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-13 23:38:15,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2024-11-13 23:38:15,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 49 states have internal predecessors, (64), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 23:38:15,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 86 transitions. [2024-11-13 23:38:15,780 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 86 transitions. Word has length 6 [2024-11-13 23:38:15,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:38:15,782 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 86 transitions. [2024-11-13 23:38:15,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:38:15,783 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 86 transitions. [2024-11-13 23:38:15,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 23:38:15,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:38:15,784 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:38:15,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 23:38:15,785 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:38:15,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:38:15,787 INFO L85 PathProgramCache]: Analyzing trace with hash -2109872712, now seen corresponding path program 1 times [2024-11-13 23:38:15,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:38:15,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947042262] [2024-11-13 23:38:15,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:38:15,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:38:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:38:15,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:38:15,973 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:38:15,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947042262] [2024-11-13 23:38:15,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947042262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:38:15,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:38:15,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:38:15,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851358568] [2024-11-13 23:38:15,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:38:15,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:38:15,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:38:15,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:38:15,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:38:15,978 INFO L87 Difference]: Start difference. First operand 66 states and 86 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 23:38:16,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:38:16,181 INFO L93 Difference]: Finished difference Result 115 states and 145 transitions. [2024-11-13 23:38:16,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:38:16,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-13 23:38:16,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:38:16,185 INFO L225 Difference]: With dead ends: 115 [2024-11-13 23:38:16,185 INFO L226 Difference]: Without dead ends: 54 [2024-11-13 23:38:16,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:38:16,186 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:38:16,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 111 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:38:16,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-13 23:38:16,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2024-11-13 23:38:16,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.28125) internal successors, (41), 35 states have internal predecessors, (41), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-13 23:38:16,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2024-11-13 23:38:16,202 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 11 [2024-11-13 23:38:16,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:38:16,202 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2024-11-13 23:38:16,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 23:38:16,203 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2024-11-13 23:38:16,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 23:38:16,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:38:16,204 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:38:16,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 23:38:16,204 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:38:16,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:38:16,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1670855318, now seen corresponding path program 1 times [2024-11-13 23:38:16,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:38:16,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090561905] [2024-11-13 23:38:16,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:38:16,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:38:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:38:16,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:38:16,911 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:38:16,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090561905] [2024-11-13 23:38:16,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090561905] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:38:16,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461928228] [2024-11-13 23:38:16,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:38:16,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:38:16,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:38:16,917 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:38:16,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 23:38:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:38:17,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-13 23:38:17,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:38:17,241 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 23:38:17,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 23:38:17,579 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2024-11-13 23:38:17,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 184 [2024-11-13 23:38:17,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-13 23:38:17,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-13 23:38:17,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-13 23:38:17,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-13 23:38:18,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 14 [2024-11-13 23:38:18,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:38:18,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:38:18,859 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-13 23:38:18,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 73 [2024-11-13 23:38:18,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-13 23:38:20,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-13 23:38:20,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:38:20,448 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:38:20,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:38:20,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3430 treesize of output 3359 [2024-11-13 23:38:20,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 594 treesize of output 578 [2024-11-13 23:38:20,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 626 treesize of output 594 [2024-11-13 23:38:21,220 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:38:21,221 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:38:21,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:38:21,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2024-11-13 23:38:21,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:38:21,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:38:21,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:38:21,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461928228] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:38:21,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1672043306] [2024-11-13 23:38:21,481 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-13 23:38:21,481 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:38:21,486 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-13 23:38:21,491 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-13 23:38:21,492 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-13 23:38:23,177 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_successful_malloc with input of size 96 for LOIs [2024-11-13 23:38:23,281 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_list_add with input of size 31 for LOIs [2024-11-13 23:38:23,423 INFO L197 IcfgInterpreter]: Interpreting procedure __ldv_list_add with input of size 39 for LOIs [2024-11-13 23:38:23,432 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-13 23:38:34,783 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '731#(and (= |~#drvlist~0.offset| 0) (<= 1 |#StackHeapBarrier|) (or (not (= (select (select |#memory_$Pointer$.base| 3) 0) 3)) (not (= (select (select |#memory_$Pointer$.offset| 3) 0) 0))) (= |~#mutexes~0.base| 3) (= |~#mutexes~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| 4) 0) 0) (= (select (select |#memory_$Pointer$.base| 4) 0) 4) (= 4 |~#drvlist~0.base|))' at error location [2024-11-13 23:38:34,784 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-13 23:38:34,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:38:34,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 32 [2024-11-13 23:38:34,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878306603] [2024-11-13 23:38:34,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:38:34,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-13 23:38:34,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:38:34,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-13 23:38:34,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2154, Unknown=5, NotChecked=0, Total=2352 [2024-11-13 23:38:34,788 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 32 states, 20 states have (on average 1.65) internal successors, (33), 25 states have internal predecessors, (33), 9 states have call successors, (9), 4 states have call predecessors, (9), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-13 23:38:39,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:38:39,088 INFO L93 Difference]: Finished difference Result 142 states and 177 transitions. [2024-11-13 23:38:39,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 23:38:39,089 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 20 states have (on average 1.65) internal successors, (33), 25 states have internal predecessors, (33), 9 states have call successors, (9), 4 states have call predecessors, (9), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 19 [2024-11-13 23:38:39,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:38:39,091 INFO L225 Difference]: With dead ends: 142 [2024-11-13 23:38:39,091 INFO L226 Difference]: Without dead ends: 126 [2024-11-13 23:38:39,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=479, Invalid=4072, Unknown=5, NotChecked=0, Total=4556 [2024-11-13 23:38:39,098 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 446 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:38:39,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 443 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-13 23:38:39,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-13 23:38:39,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 85. [2024-11-13 23:38:39,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 64 states have internal predecessors, (82), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 23:38:39,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 110 transitions. [2024-11-13 23:38:39,126 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 110 transitions. Word has length 19 [2024-11-13 23:38:39,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:38:39,127 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 110 transitions. [2024-11-13 23:38:39,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 20 states have (on average 1.65) internal successors, (33), 25 states have internal predecessors, (33), 9 states have call successors, (9), 4 states have call predecessors, (9), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-13 23:38:39,127 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2024-11-13 23:38:39,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 23:38:39,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:38:39,128 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:38:39,149 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-13 23:38:39,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:38:39,328 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:38:39,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:38:39,329 INFO L85 PathProgramCache]: Analyzing trace with hash 358228038, now seen corresponding path program 1 times [2024-11-13 23:38:39,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:38:39,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16302715] [2024-11-13 23:38:39,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:38:39,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:38:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:38:39,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:38:39,430 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:38:39,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16302715] [2024-11-13 23:38:39,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16302715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:38:39,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:38:39,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:38:39,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585664059] [2024-11-13 23:38:39,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:38:39,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:38:39,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:38:39,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:38:39,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:38:39,432 INFO L87 Difference]: Start difference. First operand 85 states and 110 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-13 23:38:39,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:38:39,572 INFO L93 Difference]: Finished difference Result 97 states and 127 transitions. [2024-11-13 23:38:39,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:38:39,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 24 [2024-11-13 23:38:39,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:38:39,574 INFO L225 Difference]: With dead ends: 97 [2024-11-13 23:38:39,574 INFO L226 Difference]: Without dead ends: 95 [2024-11-13 23:38:39,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:38:39,575 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:38:39,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:38:39,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-13 23:38:39,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2024-11-13 23:38:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 70 states have internal predecessors, (88), 14 states have call successors, (14), 8 states have call predecessors, (14), 10 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2024-11-13 23:38:39,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. [2024-11-13 23:38:39,593 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 24 [2024-11-13 23:38:39,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:38:39,594 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. [2024-11-13 23:38:39,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-13 23:38:39,594 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. [2024-11-13 23:38:39,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 23:38:39,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:38:39,595 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:38:39,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 23:38:39,595 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:38:39,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:38:39,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1506602899, now seen corresponding path program 1 times [2024-11-13 23:38:39,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:38:39,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133554619] [2024-11-13 23:38:39,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:38:39,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:38:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:38:41,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:38:41,889 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:38:41,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133554619] [2024-11-13 23:38:41,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133554619] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:38:41,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512184653] [2024-11-13 23:38:41,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:38:41,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:38:41,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:38:41,892 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:38:41,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 23:38:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:38:42,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-13 23:38:42,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:38:42,375 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 23:38:42,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 23:38:42,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-13 23:38:43,174 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-13 23:38:43,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2024-11-13 23:38:43,188 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-13 23:38:43,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 11 [2024-11-13 23:38:43,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:38:43,618 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:38:44,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512184653] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:38:44,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1143391014] [2024-11-13 23:38:44,985 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-13 23:38:44,985 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:38:44,985 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-13 23:38:44,985 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-13 23:38:44,985 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-13 23:38:46,458 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_successful_malloc with input of size 24 for LOIs [2024-11-13 23:38:46,464 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_is_in_set with input of size 103 for LOIs [2024-11-13 23:38:46,703 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_list_add with input of size 31 for LOIs [2024-11-13 23:38:46,767 INFO L197 IcfgInterpreter]: Interpreting procedure __ldv_list_add with input of size 39 for LOIs [2024-11-13 23:38:46,774 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-13 23:38:53,407 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1411#true' at error location [2024-11-13 23:38:53,407 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-13 23:38:53,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 23:38:53,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 27 [2024-11-13 23:38:53,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358780081] [2024-11-13 23:38:53,407 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 23:38:53,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-13 23:38:53,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:38:53,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-13 23:38:53,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=2145, Unknown=8, NotChecked=0, Total=2352 [2024-11-13 23:38:53,413 INFO L87 Difference]: Start difference. First operand 93 states and 122 transitions. Second operand has 27 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 20 states have internal predecessors, (31), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-13 23:38:59,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:38:59,695 INFO L93 Difference]: Finished difference Result 248 states and 336 transitions. [2024-11-13 23:38:59,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 23:38:59,695 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 20 states have internal predecessors, (31), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 25 [2024-11-13 23:38:59,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:38:59,697 INFO L225 Difference]: With dead ends: 248 [2024-11-13 23:38:59,697 INFO L226 Difference]: Without dead ends: 166 [2024-11-13 23:38:59,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=481, Invalid=4478, Unknown=11, NotChecked=0, Total=4970 [2024-11-13 23:38:59,702 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 138 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-13 23:38:59,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 309 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-13 23:38:59,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-13 23:38:59,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 128. [2024-11-13 23:38:59,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 96 states have internal predecessors, (123), 19 states have call successors, (19), 11 states have call predecessors, (19), 14 states have return successors, (26), 20 states have call predecessors, (26), 19 states have call successors, (26) [2024-11-13 23:38:59,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 168 transitions. [2024-11-13 23:38:59,736 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 168 transitions. Word has length 25 [2024-11-13 23:38:59,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:38:59,736 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 168 transitions. [2024-11-13 23:38:59,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 20 states have internal predecessors, (31), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-13 23:38:59,736 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 168 transitions. [2024-11-13 23:38:59,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-13 23:38:59,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:38:59,738 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:38:59,758 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 23:38:59,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:38:59,939 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:38:59,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:38:59,940 INFO L85 PathProgramCache]: Analyzing trace with hash -642737759, now seen corresponding path program 2 times [2024-11-13 23:38:59,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:38:59,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390883797] [2024-11-13 23:38:59,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:38:59,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:38:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:39:04,352 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 23:39:04,353 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:39:04,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390883797] [2024-11-13 23:39:04,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390883797] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:39:04,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631864228] [2024-11-13 23:39:04,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 23:39:04,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:39:04,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:39:04,356 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:39:04,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 23:39:04,533 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-13 23:39:04,533 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 23:39:04,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-11-13 23:39:04,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:39:05,067 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-11-13 23:39:05,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2024-11-13 23:39:06,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2024-11-13 23:39:06,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2024-11-13 23:39:06,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2024-11-13 23:39:06,995 INFO L349 Elim1Store]: treesize reduction 27, result has 32.5 percent of original size [2024-11-13 23:39:06,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 17 [2024-11-13 23:39:07,427 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-13 23:39:07,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2024-11-13 23:39:07,877 INFO L349 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2024-11-13 23:39:07,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 36 [2024-11-13 23:39:11,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 151 [2024-11-13 23:39:11,453 INFO L349 Elim1Store]: treesize reduction 197, result has 10.9 percent of original size [2024-11-13 23:39:11,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 152 treesize of output 134 [2024-11-13 23:39:11,641 INFO L349 Elim1Store]: treesize reduction 188, result has 13.8 percent of original size [2024-11-13 23:39:11,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 207 treesize of output 239 [2024-11-13 23:39:11,733 INFO L349 Elim1Store]: treesize reduction 50, result has 23.1 percent of original size [2024-11-13 23:39:11,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 113 [2024-11-13 23:39:11,788 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:39:11,817 INFO L349 Elim1Store]: treesize reduction 61, result has 1.6 percent of original size [2024-11-13 23:39:11,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 93 [2024-11-13 23:39:11,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:39:11,967 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-13 23:39:11,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 20 [2024-11-13 23:39:12,973 INFO L349 Elim1Store]: treesize reduction 130, result has 23.5 percent of original size [2024-11-13 23:39:12,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 238 treesize of output 279 [2024-11-13 23:39:13,521 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-13 23:39:13,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 24 [2024-11-13 23:39:13,574 INFO L349 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2024-11-13 23:39:13,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 27 [2024-11-13 23:39:13,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 148 [2024-11-13 23:39:13,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 124 [2024-11-13 23:39:13,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 71 [2024-11-13 23:39:13,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 283 treesize of output 187 [2024-11-13 23:39:20,438 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:39:20,438 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:39:21,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631864228] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:39:21,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [291075798] [2024-11-13 23:39:21,892 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-13 23:39:21,892 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:39:21,892 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-13 23:39:21,892 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-13 23:39:21,893 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-13 23:39:22,737 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_successful_malloc with input of size 96 for LOIs [2024-11-13 23:39:22,795 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_is_in_set with input of size 36 for LOIs [2024-11-13 23:39:22,821 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_list_add with input of size 31 for LOIs [2024-11-13 23:39:22,892 INFO L197 IcfgInterpreter]: Interpreting procedure __ldv_list_add with input of size 39 for LOIs [2024-11-13 23:39:22,898 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-13 23:39:31,545 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2380#(and (= |~#drvlist~0.offset| 0) (<= 1 |#StackHeapBarrier|) (= |~#mutexes~0.base| 3) (= |~#mutexes~0.offset| 0) (= 4 |~#drvlist~0.base|))' at error location [2024-11-13 23:39:31,546 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-13 23:39:31,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 23:39:31,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2024-11-13 23:39:31,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4504609] [2024-11-13 23:39:31,546 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 23:39:31,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-13 23:39:31,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:39:31,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-13 23:39:31,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=4058, Unknown=60, NotChecked=0, Total=4422 [2024-11-13 23:39:31,549 INFO L87 Difference]: Start difference. First operand 128 states and 168 transitions. Second operand has 43 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 31 states have internal predecessors, (44), 13 states have call successors, (13), 9 states have call predecessors, (13), 14 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 23:39:33,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:39:39,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:39:42,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:39:50,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:39:55,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:39:57,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:39:59,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:40:14,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:40:16,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:40:26,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:40:32,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:40:32,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:32,913 INFO L93 Difference]: Finished difference Result 274 states and 358 transitions. [2024-11-13 23:40:32,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-13 23:40:32,914 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 31 states have internal predecessors, (44), 13 states have call successors, (13), 9 states have call predecessors, (13), 14 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Word has length 38 [2024-11-13 23:40:32,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:32,916 INFO L225 Difference]: With dead ends: 274 [2024-11-13 23:40:32,916 INFO L226 Difference]: Without dead ends: 183 [2024-11-13 23:40:32,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3662 ImplicationChecksByTransitivity, 49.8s TimeCoverageRelationStatistics Valid=818, Invalid=9774, Unknown=120, NotChecked=0, Total=10712 [2024-11-13 23:40:32,921 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 426 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 167 mSolverCounterUnsat, 139 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 1874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 139 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.8s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:32,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 534 Invalid, 1874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1568 Invalid, 139 Unknown, 0 Unchecked, 29.8s Time] [2024-11-13 23:40:32,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-13 23:40:32,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 147. [2024-11-13 23:40:32,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 109 states have internal predecessors, (134), 24 states have call successors, (24), 15 states have call predecessors, (24), 18 states have return successors, (29), 22 states have call predecessors, (29), 24 states have call successors, (29) [2024-11-13 23:40:32,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 187 transitions. [2024-11-13 23:40:32,981 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 187 transitions. Word has length 38 [2024-11-13 23:40:32,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:32,981 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 187 transitions. [2024-11-13 23:40:32,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 31 states have internal predecessors, (44), 13 states have call successors, (13), 9 states have call predecessors, (13), 14 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-13 23:40:32,982 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 187 transitions. [2024-11-13 23:40:32,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 23:40:32,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:32,983 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:40:33,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 23:40:33,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:40:33,184 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:40:33,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:33,185 INFO L85 PathProgramCache]: Analyzing trace with hash -473303124, now seen corresponding path program 1 times [2024-11-13 23:40:33,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:40:33,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268790225] [2024-11-13 23:40:33,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:33,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:40:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:40:33,309 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 23:40:33,309 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:40:33,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268790225] [2024-11-13 23:40:33,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268790225] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:40:33,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535992688] [2024-11-13 23:40:33,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:33,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:40:33,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:40:33,313 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:40:33,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 23:40:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:40:33,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 23:40:33,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:40:33,555 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 23:40:33,557 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:40:33,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535992688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:40:33,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 23:40:33,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-13 23:40:33,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072687324] [2024-11-13 23:40:33,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:40:33,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:40:33,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:40:33,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:40:33,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:40:33,561 INFO L87 Difference]: Start difference. First operand 147 states and 187 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-13 23:40:33,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:33,786 INFO L93 Difference]: Finished difference Result 267 states and 344 transitions. [2024-11-13 23:40:33,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:40:33,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2024-11-13 23:40:33,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:33,789 INFO L225 Difference]: With dead ends: 267 [2024-11-13 23:40:33,789 INFO L226 Difference]: Without dead ends: 159 [2024-11-13 23:40:33,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:40:33,795 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:33,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:40:33,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-13 23:40:33,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2024-11-13 23:40:33,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 110 states have (on average 1.290909090909091) internal successors, (142), 116 states have internal predecessors, (142), 24 states have call successors, (24), 15 states have call predecessors, (24), 20 states have return successors, (31), 25 states have call predecessors, (31), 24 states have call successors, (31) [2024-11-13 23:40:33,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 197 transitions. [2024-11-13 23:40:33,865 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 197 transitions. Word has length 42 [2024-11-13 23:40:33,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:33,866 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 197 transitions. [2024-11-13 23:40:33,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-13 23:40:33,866 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 197 transitions. [2024-11-13 23:40:33,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 23:40:33,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:33,872 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:40:33,897 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 23:40:34,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-13 23:40:34,077 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:40:34,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:34,077 INFO L85 PathProgramCache]: Analyzing trace with hash 403798633, now seen corresponding path program 1 times [2024-11-13 23:40:34,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:40:34,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020969983] [2024-11-13 23:40:34,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:34,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:40:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:40:34,494 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 23:40:34,495 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:40:34,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020969983] [2024-11-13 23:40:34,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020969983] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:40:34,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124992038] [2024-11-13 23:40:34,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:34,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:40:34,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:40:34,497 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:40:34,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 23:40:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:40:34,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-11-13 23:40:34,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:40:35,194 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-13 23:40:35,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-13 23:40:35,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-13 23:40:35,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-13 23:40:38,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2024-11-13 23:40:48,436 INFO L349 Elim1Store]: treesize reduction 120, result has 45.7 percent of original size [2024-11-13 23:40:48,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 533 treesize of output 592 [2024-11-13 23:40:49,389 INFO L349 Elim1Store]: treesize reduction 560, result has 24.4 percent of original size [2024-11-13 23:40:49,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 413 treesize of output 378 [2024-11-13 23:40:49,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:40:49,665 INFO L349 Elim1Store]: treesize reduction 384, result has 22.1 percent of original size [2024-11-13 23:40:49,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 212 treesize of output 327 [2024-11-13 23:40:49,925 INFO L349 Elim1Store]: treesize reduction 527, result has 12.2 percent of original size [2024-11-13 23:40:49,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 247 treesize of output 306 [2024-11-13 23:40:50,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 23:40:50,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 23:40:50,753 INFO L349 Elim1Store]: treesize reduction 42, result has 42.5 percent of original size [2024-11-13 23:40:50,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 58 [2024-11-13 23:40:50,951 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-13 23:40:50,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 26 [2024-11-13 23:40:51,076 INFO L349 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2024-11-13 23:40:51,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2024-11-13 23:40:51,141 INFO L349 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2024-11-13 23:40:51,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 1 [2024-11-13 23:40:53,596 INFO L349 Elim1Store]: treesize reduction 371, result has 21.4 percent of original size [2024-11-13 23:40:53,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 416 treesize of output 385 [2024-11-13 23:40:53,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:40:53,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-13 23:40:54,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:40:54,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 155 treesize of output 191 [2024-11-13 23:41:00,691 WARN L286 SmtUtils]: Spent 5.27s on a formula simplification. DAG size of input: 47 DAG size of output: 31 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-13 23:41:00,691 INFO L349 Elim1Store]: treesize reduction 64, result has 46.2 percent of original size [2024-11-13 23:41:00,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 3279 treesize of output 3282 [2024-11-13 23:41:25,893 INFO L349 Elim1Store]: treesize reduction 52, result has 13.3 percent of original size [2024-11-13 23:41:25,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 2747 treesize of output 2736 [2024-11-13 23:41:28,800 INFO L349 Elim1Store]: treesize reduction 52, result has 13.3 percent of original size [2024-11-13 23:41:28,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 23 [2024-11-13 23:41:29,719 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:41:29,793 INFO L349 Elim1Store]: treesize reduction 40, result has 16.7 percent of original size [2024-11-13 23:41:29,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 23 [2024-11-13 23:41:29,991 INFO L349 Elim1Store]: treesize reduction 52, result has 13.3 percent of original size [2024-11-13 23:41:29,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 23 [2024-11-13 23:41:30,509 INFO L349 Elim1Store]: treesize reduction 135, result has 38.1 percent of original size [2024-11-13 23:41:30,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 407 treesize of output 464 [2024-11-13 23:41:53,519 INFO L349 Elim1Store]: treesize reduction 42, result has 16.0 percent of original size [2024-11-13 23:41:53,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 30 [2024-11-13 23:41:53,680 INFO L349 Elim1Store]: treesize reduction 42, result has 16.0 percent of original size [2024-11-13 23:41:53,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 383 treesize of output 372 [2024-11-13 23:41:54,489 INFO L349 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2024-11-13 23:41:54,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 117 treesize of output 114 [2024-11-13 23:41:55,040 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:41:55,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-11-13 23:41:55,271 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:41:55,352 INFO L349 Elim1Store]: treesize reduction 47, result has 26.6 percent of original size [2024-11-13 23:41:55,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 38 [2024-11-13 23:41:55,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:41:55,503 INFO L349 Elim1Store]: treesize reduction 48, result has 14.3 percent of original size [2024-11-13 23:41:55,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 30 [2024-11-13 23:41:56,451 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-13 23:41:56,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 30 [2024-11-13 23:42:12,507 WARN L286 SmtUtils]: Spent 15.50s on a formula simplification. DAG size of input: 672 DAG size of output: 587 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-13 23:42:12,508 INFO L349 Elim1Store]: treesize reduction 579, result has 70.1 percent of original size [2024-11-13 23:42:12,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 137 case distinctions, treesize of input 4813 treesize of output 6082 [2024-11-13 23:49:09,143 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-13 23:49:09,143 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2024-11-13 23:49:09,143 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2024-11-13 23:49:09,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [666884799] [2024-11-13 23:49:09,145 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2024-11-13 23:49:09,146 INFO L166 IcfgInterpreter]: Building call graph [2024-11-13 23:49:09,146 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-13 23:49:09,146 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-13 23:49:09,146 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-13 23:49:09,153 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:132) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.checkSatTerm(SmtUtils.java:326) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.isFalse(SymbolicTools.java:220) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:56) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.ExplicitValueDomain.isEqBottom(ExplicitValueDomain.java:73) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.CompoundDomain.isEqBottom(CompoundDomain.java:84) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:447) at java.base/java.io.OutputStream.write(OutputStream.java:167) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:125) at java.base/java.io.BufferedOutputStream.implFlush(BufferedOutputStream.java:252) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:246) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:412) at java.base/sun.nio.cs.StreamEncoder.lockedFlush(StreamEncoder.java:214) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:201) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:262) at java.base/java.io.BufferedWriter.implFlush(BufferedWriter.java:372) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:359) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 44 more [2024-11-13 23:49:09,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-13 23:49:09,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-11-13 23:49:09,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398830706] [2024-11-13 23:49:09,157 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-13 23:49:09,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 23:49:09,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:49:09,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 23:49:09,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=204, Unknown=1, NotChecked=0, Total=240 [2024-11-13 23:49:09,159 INFO L87 Difference]: Start difference. First operand 157 states and 197 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-13 23:49:09,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=35, Invalid=204, Unknown=1, NotChecked=0, Total=240 [2024-11-13 23:49:09,161 INFO L432 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 23:49:09,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 23:49:09,182 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 23:49:09,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-13 23:49:09,362 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertCodeBlock(IncrementalHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:278) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1708) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:762) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:385) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:447) at java.base/java.io.OutputStream.write(OutputStream.java:167) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:125) at java.base/java.io.BufferedOutputStream.implFlush(BufferedOutputStream.java:252) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:246) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:412) at java.base/sun.nio.cs.StreamEncoder.lockedFlush(StreamEncoder.java:214) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:201) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:262) at java.base/java.io.BufferedWriter.implFlush(BufferedWriter.java:372) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:359) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 36 more [2024-11-13 23:49:09,365 INFO L158 Benchmark]: Toolchain (without parser) took 656081.90ms. Allocated memory was 142.6MB in the beginning and 830.5MB in the end (delta: 687.9MB). Free memory was 116.8MB in the beginning and 568.3MB in the end (delta: -451.5MB). Peak memory consumption was 232.7MB. Max. memory is 16.1GB. [2024-11-13 23:49:09,366 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 142.6MB. Free memory is still 80.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:49:09,366 INFO L158 Benchmark]: CACSL2BoogieTranslator took 643.15ms. Allocated memory is still 142.6MB. Free memory was 116.5MB in the beginning and 96.1MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 23:49:09,366 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.98ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 93.7MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 23:49:09,366 INFO L158 Benchmark]: Boogie Preprocessor took 47.23ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 91.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:49:09,367 INFO L158 Benchmark]: RCFGBuilder took 839.30ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 57.3MB in the end (delta: 34.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-13 23:49:09,367 INFO L158 Benchmark]: TraceAbstraction took 654483.86ms. Allocated memory was 142.6MB in the beginning and 830.5MB in the end (delta: 687.9MB). Free memory was 56.5MB in the beginning and 568.3MB in the end (delta: -511.8MB). Peak memory consumption was 174.0MB. Max. memory is 16.1GB. [2024-11-13 23:49:09,368 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.43ms. Allocated memory is still 142.6MB. Free memory is still 80.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 643.15ms. Allocated memory is still 142.6MB. Free memory was 116.5MB in the beginning and 96.1MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.98ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 93.7MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.23ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 91.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 839.30ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 57.3MB in the end (delta: 34.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 654483.86ms. Allocated memory was 142.6MB in the beginning and 830.5MB in the end (delta: 687.9MB). Free memory was 56.5MB in the beginning and 568.3MB in the end (delta: -511.8MB). Peak memory consumption was 174.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10aecdd717bb6691571ad1da0b912f030832fb85361f767ea82293acfe046216 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 23:49:11,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 23:49:11,936 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-13 23:49:11,941 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 23:49:11,942 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 23:49:11,999 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 23:49:12,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 23:49:12,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 23:49:12,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 23:49:12,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 23:49:12,002 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-13 23:49:12,002 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-13 23:49:12,003 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-13 23:49:12,003 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-13 23:49:12,003 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-13 23:49:12,003 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-13 23:49:12,005 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 23:49:12,005 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 23:49:12,005 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 23:49:12,005 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 23:49:12,005 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 23:49:12,005 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 23:49:12,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 23:49:12,006 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 23:49:12,006 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 23:49:12,006 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 23:49:12,007 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 23:49:12,007 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 23:49:12,007 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 23:49:12,007 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 23:49:12,007 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 23:49:12,007 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 23:49:12,008 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 23:49:12,008 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 23:49:12,009 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 23:49:12,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:49:12,009 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 23:49:12,009 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 23:49:12,009 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 23:49:12,009 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-13 23:49:12,009 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 23:49:12,009 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 23:49:12,009 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-13 23:49:12,009 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 10aecdd717bb6691571ad1da0b912f030832fb85361f767ea82293acfe046216 [2024-11-13 23:49:12,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 23:49:12,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 23:49:12,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 23:49:12,372 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 23:49:12,373 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 23:49:12,374 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i Unable to find full path for "g++" [2024-11-13 23:49:14,169 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 23:49:14,487 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 23:49:14,488 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i [2024-11-13 23:49:14,503 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/data/022f78901/96e959b2fa67408890e1ff90c9a567c2/FLAGc0a2294d5 [2024-11-13 23:49:14,732 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/data/022f78901/96e959b2fa67408890e1ff90c9a567c2 [2024-11-13 23:49:14,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 23:49:14,738 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 23:49:14,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 23:49:14,739 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 23:49:14,745 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 23:49:14,746 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:49:14" (1/1) ... [2024-11-13 23:49:14,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36dc2409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:14, skipping insertion in model container [2024-11-13 23:49:14,749 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:49:14" (1/1) ... [2024-11-13 23:49:14,802 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 23:49:15,210 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 23:49:15,245 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26271,26284] [2024-11-13 23:49:15,249 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26396,26409] [2024-11-13 23:49:15,250 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26511,26524] [2024-11-13 23:49:15,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:49:15,285 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-13 23:49:15,293 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 23:49:15,329 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-13 23:49:15,341 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26271,26284] [2024-11-13 23:49:15,342 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26396,26409] [2024-11-13 23:49:15,343 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26511,26524] [2024-11-13 23:49:15,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:49:15,355 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 23:49:15,415 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26271,26284] [2024-11-13 23:49:15,416 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26396,26409] [2024-11-13 23:49:15,417 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26511,26524] [2024-11-13 23:49:15,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:49:15,474 INFO L204 MainTranslator]: Completed translation [2024-11-13 23:49:15,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:15 WrapperNode [2024-11-13 23:49:15,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 23:49:15,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 23:49:15,477 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 23:49:15,477 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 23:49:15,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:15" (1/1) ... [2024-11-13 23:49:15,503 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:15" (1/1) ... [2024-11-13 23:49:15,530 INFO L138 Inliner]: procedures = 143, calls = 62, calls flagged for inlining = 15, calls inlined = 14, statements flattened = 177 [2024-11-13 23:49:15,530 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 23:49:15,530 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 23:49:15,530 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 23:49:15,531 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 23:49:15,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:15" (1/1) ... [2024-11-13 23:49:15,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:15" (1/1) ... [2024-11-13 23:49:15,552 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:15" (1/1) ... [2024-11-13 23:49:15,552 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:15" (1/1) ... [2024-11-13 23:49:15,581 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:15" (1/1) ... [2024-11-13 23:49:15,586 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:15" (1/1) ... [2024-11-13 23:49:15,589 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:15" (1/1) ... [2024-11-13 23:49:15,590 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:15" (1/1) ... [2024-11-13 23:49:15,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 23:49:15,599 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 23:49:15,600 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 23:49:15,600 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 23:49:15,601 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:15" (1/1) ... [2024-11-13 23:49:15,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:49:15,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:49:15,631 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 23:49:15,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 23:49:15,654 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-11-13 23:49:15,654 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-11-13 23:49:15,654 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2024-11-13 23:49:15,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2024-11-13 23:49:15,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 23:49:15,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 23:49:15,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-13 23:49:15,654 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2024-11-13 23:49:15,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2024-11-13 23:49:15,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-13 23:49:15,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 23:49:15,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-13 23:49:15,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-13 23:49:15,655 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2024-11-13 23:49:15,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2024-11-13 23:49:15,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 23:49:15,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 23:49:15,827 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 23:49:15,829 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 23:49:16,358 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-13 23:49:16,358 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 23:49:16,371 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 23:49:16,372 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-13 23:49:16,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:49:16 BoogieIcfgContainer [2024-11-13 23:49:16,372 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 23:49:16,375 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 23:49:16,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 23:49:16,380 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 23:49:16,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 11:49:14" (1/3) ... [2024-11-13 23:49:16,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31371a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:49:16, skipping insertion in model container [2024-11-13 23:49:16,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:49:15" (2/3) ... [2024-11-13 23:49:16,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31371a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:49:16, skipping insertion in model container [2024-11-13 23:49:16,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:49:16" (3/3) ... [2024-11-13 23:49:16,383 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_unbounded-1.i [2024-11-13 23:49:16,398 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 23:49:16,400 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG test_mutex_unbounded-1.i that has 5 procedures, 67 locations, 1 initial locations, 5 loop locations, and 3 error locations. [2024-11-13 23:49:16,452 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 23:49:16,464 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@90a3224, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 23:49:16,464 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-13 23:49:16,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 51 states have (on average 1.392156862745098) internal successors, (71), 54 states have internal predecessors, (71), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-13 23:49:16,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:49:16,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:49:16,477 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:49:16,477 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:49:16,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:49:16,482 INFO L85 PathProgramCache]: Analyzing trace with hash 944520660, now seen corresponding path program 1 times [2024-11-13 23:49:16,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:49:16,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146095353] [2024-11-13 23:49:16,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:49:16,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:49:16,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:49:16,496 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:49:16,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-13 23:49:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:49:16,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 23:49:16,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:49:16,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:49:16,679 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:49:16,680 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:49:16,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2146095353] [2024-11-13 23:49:16,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2146095353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:49:16,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:49:16,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 23:49:16,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495674191] [2024-11-13 23:49:16,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:49:16,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 23:49:16,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:49:16,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 23:49:16,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 23:49:16,713 INFO L87 Difference]: Start difference. First operand has 67 states, 51 states have (on average 1.392156862745098) internal successors, (71), 54 states have internal predecessors, (71), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 23:49:16,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:49:16,744 INFO L93 Difference]: Finished difference Result 131 states and 176 transitions. [2024-11-13 23:49:16,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 23:49:16,747 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-13 23:49:16,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:49:16,754 INFO L225 Difference]: With dead ends: 131 [2024-11-13 23:49:16,755 INFO L226 Difference]: Without dead ends: 62 [2024-11-13 23:49:16,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 23:49:16,763 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 23:49:16,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 23:49:16,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-13 23:49:16,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-13 23:49:16,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 49 states have internal predecessors, (57), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-13 23:49:16,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2024-11-13 23:49:16,814 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 14 [2024-11-13 23:49:16,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:49:16,814 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2024-11-13 23:49:16,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 23:49:16,815 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2024-11-13 23:49:16,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:49:16,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:49:16,818 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:49:16,822 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-13 23:49:17,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:49:17,019 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:49:17,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:49:17,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1859737652, now seen corresponding path program 1 times [2024-11-13 23:49:17,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:49:17,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595861974] [2024-11-13 23:49:17,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:49:17,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:49:17,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:49:17,027 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:49:17,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-13 23:49:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:49:17,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 23:49:17,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:49:17,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:49:17,433 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:49:17,433 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:49:17,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595861974] [2024-11-13 23:49:17,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595861974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:49:17,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:49:17,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 23:49:17,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188571786] [2024-11-13 23:49:17,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:49:17,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:49:17,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:49:17,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:49:17,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:49:17,439 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 23:49:17,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:49:17,962 INFO L93 Difference]: Finished difference Result 137 states and 160 transitions. [2024-11-13 23:49:17,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:49:17,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-13 23:49:17,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:49:17,966 INFO L225 Difference]: With dead ends: 137 [2024-11-13 23:49:17,966 INFO L226 Difference]: Without dead ends: 84 [2024-11-13 23:49:17,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:49:17,967 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 20 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 23:49:17,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 168 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 23:49:17,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-13 23:49:17,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 73. [2024-11-13 23:49:17,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 59 states have internal predecessors, (67), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-13 23:49:17,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2024-11-13 23:49:17,990 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 14 [2024-11-13 23:49:17,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:49:17,990 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2024-11-13 23:49:17,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 23:49:17,991 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2024-11-13 23:49:17,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 23:49:17,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:49:17,993 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:49:17,997 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-13 23:49:18,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:49:18,194 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:49:18,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:49:18,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1128792487, now seen corresponding path program 1 times [2024-11-13 23:49:18,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:49:18,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [675675296] [2024-11-13 23:49:18,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:49:18,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:49:18,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:49:18,200 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:49:18,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-13 23:49:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:49:18,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-13 23:49:18,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:49:18,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:49:18,491 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:49:18,491 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:49:18,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [675675296] [2024-11-13 23:49:18,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [675675296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:49:18,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:49:18,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:49:18,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190153747] [2024-11-13 23:49:18,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:49:18,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:49:18,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:49:18,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:49:18,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:49:18,494 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:49:18,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:49:18,885 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2024-11-13 23:49:18,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:49:18,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-13 23:49:18,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:49:18,887 INFO L225 Difference]: With dead ends: 84 [2024-11-13 23:49:18,887 INFO L226 Difference]: Without dead ends: 74 [2024-11-13 23:49:18,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-13 23:49:18,889 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 14 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 23:49:18,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 313 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 23:49:18,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-13 23:49:18,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2024-11-13 23:49:18,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 55 states have internal predecessors, (62), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-13 23:49:18,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2024-11-13 23:49:18,899 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 13 [2024-11-13 23:49:18,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:49:18,899 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2024-11-13 23:49:18,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:49:18,900 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2024-11-13 23:49:18,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 23:49:18,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:49:18,901 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:49:18,904 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-13 23:49:19,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:49:19,104 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:49:19,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:49:19,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1088281775, now seen corresponding path program 1 times [2024-11-13 23:49:19,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:49:19,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1671073700] [2024-11-13 23:49:19,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:49:19,105 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:49:19,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:49:19,106 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:49:19,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-13 23:49:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:49:19,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 23:49:19,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:49:19,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:49:19,312 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:49:19,312 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:49:19,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1671073700] [2024-11-13 23:49:19,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1671073700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:49:19,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:49:19,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:49:19,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498414931] [2024-11-13 23:49:19,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:49:19,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:49:19,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:49:19,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:49:19,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:49:19,317 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-13 23:49:19,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:49:19,346 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2024-11-13 23:49:19,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:49:19,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2024-11-13 23:49:19,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:49:19,348 INFO L225 Difference]: With dead ends: 74 [2024-11-13 23:49:19,348 INFO L226 Difference]: Without dead ends: 72 [2024-11-13 23:49:19,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:49:19,349 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 23:49:19,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 23:49:19,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-13 23:49:19,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-13 23:49:19,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 57 states have internal predecessors, (64), 9 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-13 23:49:19,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2024-11-13 23:49:19,360 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 32 [2024-11-13 23:49:19,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:49:19,360 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2024-11-13 23:49:19,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-13 23:49:19,361 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2024-11-13 23:49:19,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-13 23:49:19,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:49:19,362 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:49:19,366 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-13 23:49:19,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:49:19,563 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:49:19,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:49:19,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1140922472, now seen corresponding path program 1 times [2024-11-13 23:49:19,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:49:19,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1230545645] [2024-11-13 23:49:19,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:49:19,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:49:19,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:49:19,569 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:49:19,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-13 23:49:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:49:19,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-13 23:49:19,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:49:20,352 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 23:49:20,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-13 23:49:20,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-13 23:49:20,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 23:49:21,066 WARN L873 $PredicateComparison]: unable to prove that (and (= (_ bv3 32) |c_~#mutexes~0.base|) (let ((.cse0 (= |c___ldv_list_add_#in~new.base| |c___ldv_list_add_#in~prev.base|)) (.cse2 (select |c_old(#memory_$Pointer$.offset)| |c___ldv_list_add_#in~next.base|)) (.cse4 (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~prev.base|)) (.cse5 (select |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base|)) (.cse6 (select |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~prev.base|))) (or (and (not .cse0) (exists ((v___ldv_list_add_~next.offset_5 (_ BitVec 32)) (v___ldv_list_add_~new.offset_5 (_ BitVec 32)) (v___ldv_list_add_~prev.offset_5 (_ BitVec 32))) (let ((.cse3 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_5))) (and (= |c_#memory_$Pointer$.offset| (store (let ((.cse1 (store |c_old(#memory_$Pointer$.offset)| |c___ldv_list_add_#in~next.base| (store .cse2 .cse3 v___ldv_list_add_~new.offset_5)))) (store .cse1 |c___ldv_list_add_#in~new.base| (store (store (select .cse1 |c___ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_5 v___ldv_list_add_~next.offset_5) (bvadd (_ bv4 32) v___ldv_list_add_~new.offset_5) v___ldv_list_add_~prev.offset_5))) |c___ldv_list_add_#in~prev.base| .cse4)) (= |c_#memory_$Pointer$.base| (store (store (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| (store .cse5 .cse3 |c___ldv_list_add_#in~new.base|)) |c___ldv_list_add_#in~new.base| (select |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~new.base|)) |c___ldv_list_add_#in~prev.base| .cse6)))))) (and .cse0 (exists ((v___ldv_list_add_~next.offset_5 (_ BitVec 32)) (v___ldv_list_add_~new.offset_5 (_ BitVec 32)) (v___ldv_list_add_~prev.offset_5 (_ BitVec 32))) (let ((.cse8 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_5))) (and (= |c_#memory_$Pointer$.offset| (store (let ((.cse7 (store |c_old(#memory_$Pointer$.offset)| |c___ldv_list_add_#in~next.base| (store .cse2 .cse8 v___ldv_list_add_~new.offset_5)))) (store .cse7 |c___ldv_list_add_#in~new.base| (store (store (select .cse7 |c___ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_5 v___ldv_list_add_~next.offset_5) (bvadd (_ bv4 32) v___ldv_list_add_~new.offset_5) v___ldv_list_add_~prev.offset_5))) |c___ldv_list_add_#in~prev.base| .cse4)) (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| (store .cse5 .cse8 |c___ldv_list_add_#in~new.base|)) |c___ldv_list_add_#in~prev.base| .cse6)))))))) (= |c_~#drvlist~0.base| (_ bv4 32))) is different from true [2024-11-13 23:49:25,332 INFO L349 Elim1Store]: treesize reduction 13, result has 59.4 percent of original size [2024-11-13 23:49:25,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 135 [2024-11-13 23:49:25,385 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2024-11-13 23:49:25,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 70 [2024-11-13 23:49:25,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-13 23:49:25,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 11 [2024-11-13 23:49:25,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 47 [2024-11-13 23:49:25,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-13 23:49:25,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-13 23:49:26,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:49:26,628 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:49:37,465 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:49:37,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1230545645] [2024-11-13 23:49:37,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1230545645] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:49:37,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [357691988] [2024-11-13 23:49:37,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:49:37,466 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:49:37,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-13 23:49:37,468 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:49:37,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-13 23:49:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:49:37,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-13 23:49:37,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:49:39,049 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 23:49:39,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-13 23:49:45,708 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-13 23:49:45,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 11 [2024-11-13 23:49:45,723 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-13 23:49:45,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 21 [2024-11-13 23:49:47,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:49:47,430 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:49:50,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [357691988] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:49:50,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483210759] [2024-11-13 23:49:50,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:49:50,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:49:50,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:49:50,409 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:49:50,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 23:49:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:49:50,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-13 23:49:50,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:49:50,783 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 23:49:50,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-13 23:49:50,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 23:49:50,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-13 23:50:03,869 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2024-11-13 23:50:03,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 59 [2024-11-13 23:50:03,884 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-13 23:50:03,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2024-11-13 23:50:03,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 16 [2024-11-13 23:50:04,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:50:04,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:50:07,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483210759] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 23:50:07,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 23:50:07,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 29 [2024-11-13 23:50:07,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146529619] [2024-11-13 23:50:07,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 23:50:07,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-13 23:50:07,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:50:07,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-13 23:50:07,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1011, Unknown=37, NotChecked=66, Total=1260 [2024-11-13 23:50:07,621 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand has 30 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 23 states have internal predecessors, (50), 8 states have call successors, (8), 6 states have call predecessors, (8), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-13 23:50:09,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:50:13,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:50:18,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:50:20,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:50:24,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:50:26,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:50:28,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:50:30,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:50:32,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:50:36,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:50:38,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:50:55,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:50:57,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:51:01,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:51:04,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:51:13,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:51:13,806 INFO L93 Difference]: Finished difference Result 195 states and 238 transitions. [2024-11-13 23:51:13,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 23:51:13,807 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 23 states have internal predecessors, (50), 8 states have call successors, (8), 6 states have call predecessors, (8), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 32 [2024-11-13 23:51:13,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:51:13,808 INFO L225 Difference]: With dead ends: 195 [2024-11-13 23:51:13,808 INFO L226 Difference]: Without dead ends: 139 [2024-11-13 23:51:13,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 71.1s TimeCoverageRelationStatistics Valid=247, Invalid=1602, Unknown=47, NotChecked=84, Total=1980 [2024-11-13 23:51:13,811 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 113 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 28 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 35.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:51:13,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 604 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 808 Invalid, 23 Unknown, 157 Unchecked, 35.1s Time] [2024-11-13 23:51:13,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-13 23:51:13,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 113. [2024-11-13 23:51:13,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 86 states have (on average 1.2325581395348837) internal successors, (106), 89 states have internal predecessors, (106), 14 states have call successors, (14), 8 states have call predecessors, (14), 10 states have return successors, (18), 15 states have call predecessors, (18), 14 states have call successors, (18) [2024-11-13 23:51:13,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2024-11-13 23:51:13,833 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 32 [2024-11-13 23:51:13,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:51:13,833 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2024-11-13 23:51:13,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 23 states have internal predecessors, (50), 8 states have call successors, (8), 6 states have call predecessors, (8), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-13 23:51:13,834 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2024-11-13 23:51:13,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 23:51:13,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:51:13,835 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:51:13,855 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 23:51:14,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-11-13 23:51:14,238 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-13 23:51:14,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:51:14,436 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:51:14,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:51:14,436 INFO L85 PathProgramCache]: Analyzing trace with hash -895147754, now seen corresponding path program 1 times [2024-11-13 23:51:14,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:51:14,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596451469] [2024-11-13 23:51:14,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:51:14,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:51:14,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:51:14,439 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:51:14,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-13 23:51:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:51:14,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-13 23:51:14,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:51:14,708 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 23:51:14,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-13 23:51:14,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2024-11-13 23:51:14,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 74 [2024-11-13 23:51:15,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2024-11-13 23:51:15,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 55 [2024-11-13 23:51:15,118 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2024-11-13 23:51:15,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 47 [2024-11-13 23:51:15,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2024-11-13 23:51:15,202 INFO L349 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2024-11-13 23:51:15,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2024-11-13 23:51:15,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2024-11-13 23:51:15,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2024-11-13 23:51:15,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2024-11-13 23:51:15,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2024-11-13 23:51:15,450 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2024-11-13 23:51:15,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 26 [2024-11-13 23:51:15,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 42 [2024-11-13 23:51:15,657 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2024-11-13 23:51:15,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 26 [2024-11-13 23:51:15,666 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:51:15,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 28 [2024-11-13 23:51:17,143 INFO L349 Elim1Store]: treesize reduction 78, result has 25.0 percent of original size [2024-11-13 23:51:17,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 42 [2024-11-13 23:51:17,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2024-11-13 23:51:17,857 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-11-13 23:51:17,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 30 [2024-11-13 23:51:17,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 32 [2024-11-13 23:51:17,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-13 23:51:17,922 INFO L349 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2024-11-13 23:51:17,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 22 [2024-11-13 23:51:19,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-13 23:51:19,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:51:19,530 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:51:21,188 INFO L349 Elim1Store]: treesize reduction 136, result has 36.7 percent of original size [2024-11-13 23:51:21,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 1118 treesize of output 653 [2024-11-13 23:51:21,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 148 [2024-11-13 23:51:21,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 146 [2024-11-13 23:51:21,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:51:21,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 229 treesize of output 253 [2024-11-13 23:51:21,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 23:51:21,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-13 23:51:21,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:51:21,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2024-11-13 23:51:22,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-13 23:51:22,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 23:51:22,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-11-13 23:51:22,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-11-13 23:51:22,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:51:22,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2024-11-13 23:51:23,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:51:23,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 227 treesize of output 419 [2024-11-13 23:51:24,715 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:51:24,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:51:24,729 INFO L349 Elim1Store]: treesize reduction 94, result has 1.1 percent of original size [2024-11-13 23:51:24,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 1 [2024-11-13 23:51:25,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:51:25,210 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:51:25,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596451469] [2024-11-13 23:51:25,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1596451469] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:51:25,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [743259449] [2024-11-13 23:51:25,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:51:25,210 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:51:25,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-13 23:51:25,215 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:51:25,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-13 23:51:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:51:25,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-13 23:51:25,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:51:26,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2024-11-13 23:51:26,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-13 23:51:26,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-13 23:51:26,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:51:26,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-13 23:51:26,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 23:51:26,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 39 [2024-11-13 23:51:26,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 37 [2024-11-13 23:51:26,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 44 [2024-11-13 23:51:26,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2024-11-13 23:51:27,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:51:27,170 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:51:27,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [743259449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:51:27,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-13 23:51:27,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 13] total 35 [2024-11-13 23:51:27,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309301546] [2024-11-13 23:51:27,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:51:27,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 23:51:27,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:51:27,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 23:51:27,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1078, Unknown=0, NotChecked=0, Total=1190 [2024-11-13 23:51:27,172 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand has 12 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 23:51:30,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:51:30,036 INFO L93 Difference]: Finished difference Result 260 states and 331 transitions. [2024-11-13 23:51:30,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 23:51:30,037 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 31 [2024-11-13 23:51:30,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:51:30,038 INFO L225 Difference]: With dead ends: 260 [2024-11-13 23:51:30,038 INFO L226 Difference]: Without dead ends: 212 [2024-11-13 23:51:30,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=175, Invalid=1805, Unknown=0, NotChecked=0, Total=1980 [2024-11-13 23:51:30,043 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 170 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-13 23:51:30,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 406 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-13 23:51:30,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-13 23:51:30,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 150. [2024-11-13 23:51:30,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 116 states have (on average 1.25) internal successors, (145), 120 states have internal predecessors, (145), 18 states have call successors, (18), 10 states have call predecessors, (18), 13 states have return successors, (25), 19 states have call predecessors, (25), 18 states have call successors, (25) [2024-11-13 23:51:30,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 188 transitions. [2024-11-13 23:51:30,095 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 188 transitions. Word has length 31 [2024-11-13 23:51:30,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:51:30,099 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 188 transitions. [2024-11-13 23:51:30,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 23:51:30,100 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 188 transitions. [2024-11-13 23:51:30,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-13 23:51:30,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:51:30,101 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:51:30,108 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-13 23:51:30,304 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-11-13 23:51:30,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-13 23:51:30,502 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:51:30,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:51:30,503 INFO L85 PathProgramCache]: Analyzing trace with hash 233306763, now seen corresponding path program 2 times [2024-11-13 23:51:30,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:51:30,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909174922] [2024-11-13 23:51:30,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 23:51:30,504 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:51:30,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:51:30,506 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 23:51:30,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65244e12-e1a6-473c-8eb1-3bc8a200960d/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-13 23:51:30,725 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 23:51:30,725 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 23:51:30,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-11-13 23:51:30,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:51:31,249 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-13 23:51:31,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-13 23:51:31,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-13 23:51:31,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-13 23:51:35,697 WARN L851 $PredicateComparison]: unable to prove that (and (= (_ bv3 32) |c_~#mutexes~0.base|) (= |c_~#drvlist~0.base| (_ bv4 32)) (let ((.cse1 (= |c___ldv_list_add_#in~new.base| |c___ldv_list_add_#in~prev.base|)) (.cse11 (= |c___ldv_list_add_#in~next.base| |c___ldv_list_add_#in~new.base|)) (.cse0 (= |c___ldv_list_add_#in~next.base| |c___ldv_list_add_#in~prev.base|))) (let ((.cse12 (not .cse0)) (.cse27 (not .cse11)) (.cse16 (select |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base|)) (.cse17 (select |c_#memory_$Pointer$.base| |c___ldv_list_add_#in~next.base|)) (.cse6 (not .cse1)) (.cse8 (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~new.base|)) (.cse2 (select |c_old(#memory_$Pointer$.offset)| |c___ldv_list_add_#in~next.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c___ldv_list_add_#in~prev.base|)) (.cse5 (select |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~new.base|))) (or (and .cse0 (or (and .cse1 (exists ((v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (and (= |c_#memory_$Pointer$.offset| (store (store |c_old(#memory_$Pointer$.offset)| |c___ldv_list_add_#in~next.base| (store .cse2 |c___ldv_list_add_#in~prev.offset| v___ldv_list_add_~new.offset_36)) |c___ldv_list_add_#in~prev.base| .cse3)) (= |c_#memory_$Pointer$.base| (let ((.cse4 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~new.base| (store (store .cse5 v___ldv_list_add_~new.offset_36 |c___ldv_list_add_#in~next.base|) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c___ldv_list_add_#in~prev.base|)))) (store .cse4 |c___ldv_list_add_#in~prev.base| (store (select .cse4 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))))))) (and .cse6 (exists ((v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (and (= |c_#memory_$Pointer$.base| (let ((.cse7 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~new.base| (store (store .cse5 v___ldv_list_add_~new.offset_36 |c___ldv_list_add_#in~next.base|) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c___ldv_list_add_#in~prev.base|)))) (store .cse7 |c___ldv_list_add_#in~prev.base| (store (select .cse7 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (= |c_#memory_$Pointer$.offset| (store (store (store |c_old(#memory_$Pointer$.offset)| |c___ldv_list_add_#in~next.base| (store .cse2 |c___ldv_list_add_#in~prev.offset| v___ldv_list_add_~new.offset_36)) |c___ldv_list_add_#in~new.base| .cse8) |c___ldv_list_add_#in~prev.base| .cse3))))))) (and (or (and .cse1 (exists ((v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (and (= |c_#memory_$Pointer$.base| (let ((.cse9 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~new.base| (store (store .cse5 v___ldv_list_add_~new.offset_36 |c___ldv_list_add_#in~next.base|) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c___ldv_list_add_#in~prev.base|)))) (store .cse9 |c___ldv_list_add_#in~prev.base| (store (select .cse9 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (= (store (store |c_old(#memory_$Pointer$.offset)| |c___ldv_list_add_#in~next.base| (store .cse2 v___ldv_list_add_~new.offset_36 v___ldv_list_add_~new.offset_36)) |c___ldv_list_add_#in~prev.base| .cse3) |c_#memory_$Pointer$.offset|)))) (and .cse6 (exists ((v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (and (= |c_#memory_$Pointer$.base| (let ((.cse10 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~new.base| (store (store .cse5 v___ldv_list_add_~new.offset_36 |c___ldv_list_add_#in~next.base|) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c___ldv_list_add_#in~prev.base|)))) (store .cse10 |c___ldv_list_add_#in~prev.base| (store (select .cse10 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (= (store (store (store |c_old(#memory_$Pointer$.offset)| |c___ldv_list_add_#in~next.base| (store .cse2 v___ldv_list_add_~new.offset_36 v___ldv_list_add_~new.offset_36)) |c___ldv_list_add_#in~new.base| .cse8) |c___ldv_list_add_#in~prev.base| .cse3) |c_#memory_$Pointer$.offset|))))) .cse11) (and .cse1 (or (and .cse12 (or (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32)) (v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse13 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (not (= v___ldv_list_add_~new.offset_36 v___ldv_list_add_~next.offset_36)) (= (store (store |c_old(#memory_$Pointer$.offset)| |c___ldv_list_add_#in~next.base| (store .cse2 .cse13 v___ldv_list_add_~new.offset_36)) |c___ldv_list_add_#in~prev.base| .cse3) |c_#memory_$Pointer$.offset|) (not (= v___ldv_list_add_~new.offset_36 .cse13)) (= (let ((.cse14 (let ((.cse15 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| (store .cse16 .cse13 (select .cse17 .cse13))))) (store .cse15 |c___ldv_list_add_#in~new.base| (store (store (select .cse15 |c___ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 |c___ldv_list_add_#in~next.base|) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c___ldv_list_add_#in~prev.base|))))) (store .cse14 |c___ldv_list_add_#in~prev.base| (store (select .cse14 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$.base|)))) (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32)) (v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse18 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (= (store (store |c_old(#memory_$Pointer$.offset)| |c___ldv_list_add_#in~next.base| (store .cse2 .cse18 v___ldv_list_add_~new.offset_36)) |c___ldv_list_add_#in~prev.base| .cse3) |c_#memory_$Pointer$.offset|) (not (= v___ldv_list_add_~new.offset_36 .cse18)) (= (let ((.cse19 (let ((.cse20 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| (store .cse16 .cse18 (select .cse17 .cse18))))) (store .cse20 |c___ldv_list_add_#in~new.base| (store (store (select .cse20 |c___ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 |c___ldv_list_add_#in~next.base|) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c___ldv_list_add_#in~prev.base|))))) (store .cse19 |c___ldv_list_add_#in~prev.base| (store (select .cse19 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$.base|)))) (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32)) (v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse21 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (= (store (store |c_old(#memory_$Pointer$.offset)| |c___ldv_list_add_#in~next.base| (store .cse2 .cse21 v___ldv_list_add_~new.offset_36)) |c___ldv_list_add_#in~prev.base| .cse3) |c_#memory_$Pointer$.offset|) (= (let ((.cse22 (let ((.cse23 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| (store .cse16 .cse21 (select .cse17 .cse21))))) (store .cse23 |c___ldv_list_add_#in~new.base| (store (store (select .cse23 |c___ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 |c___ldv_list_add_#in~next.base|) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c___ldv_list_add_#in~prev.base|))))) (store .cse22 |c___ldv_list_add_#in~prev.base| (store (select .cse22 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$.base|)))))) (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32))) (let ((.cse24 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (not (= |c___ldv_list_add_#in~prev.offset| .cse24)) (exists ((v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (and (not (= v___ldv_list_add_~new.offset_36 v___ldv_list_add_~next.offset_36)) (= (store (store |c_old(#memory_$Pointer$.offset)| |c___ldv_list_add_#in~next.base| (store .cse2 .cse24 v___ldv_list_add_~new.offset_36)) |c___ldv_list_add_#in~prev.base| .cse3) |c_#memory_$Pointer$.offset|) (not (= v___ldv_list_add_~new.offset_36 .cse24)) (= (let ((.cse25 (let ((.cse26 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| (store .cse16 .cse24 (select .cse17 .cse24))))) (store .cse26 |c___ldv_list_add_#in~new.base| (store (store (select .cse26 |c___ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 |c___ldv_list_add_#in~next.base|) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c___ldv_list_add_#in~prev.base|))))) (store .cse25 |c___ldv_list_add_#in~prev.base| (store (select .cse25 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$.base|)))))) (and .cse27 (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32)) (v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse28 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (= (store (store |c_old(#memory_$Pointer$.offset)| |c___ldv_list_add_#in~next.base| (store .cse2 .cse28 v___ldv_list_add_~new.offset_36)) |c___ldv_list_add_#in~prev.base| .cse3) |c_#memory_$Pointer$.offset|) (not (= |c___ldv_list_add_#in~prev.offset| .cse28)) (not (= v___ldv_list_add_~new.offset_36 .cse28)) (= (let ((.cse29 (let ((.cse30 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| (store .cse16 .cse28 (select .cse17 .cse28))))) (store .cse30 |c___ldv_list_add_#in~new.base| (store (store (select .cse30 |c___ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 |c___ldv_list_add_#in~next.base|) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c___ldv_list_add_#in~prev.base|))))) (store .cse29 |c___ldv_list_add_#in~prev.base| (store (select .cse29 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$.base|))))) (and .cse27 (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32)) (v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse31 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (= (store (store |c_old(#memory_$Pointer$.offset)| |c___ldv_list_add_#in~next.base| (store .cse2 .cse31 v___ldv_list_add_~new.offset_36)) |c___ldv_list_add_#in~prev.base| .cse3) |c_#memory_$Pointer$.offset|) (not (= |c___ldv_list_add_#in~prev.offset| .cse31)) (= (let ((.cse32 (let ((.cse33 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| (store .cse16 .cse31 (select .cse17 .cse31))))) (store .cse33 |c___ldv_list_add_#in~new.base| (store (store (select .cse33 |c___ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 |c___ldv_list_add_#in~next.base|) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c___ldv_list_add_#in~prev.base|))))) (store .cse32 |c___ldv_list_add_#in~prev.base| (store (select .cse32 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$.base|))))))) (and (or (and (or (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32)) (v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse34 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (not (= v___ldv_list_add_~new.offset_36 v___ldv_list_add_~next.offset_36)) (not (= v___ldv_list_add_~new.offset_36 .cse34)) (= |c_#memory_$Pointer$.offset| (store (store (store |c_old(#memory_$Pointer$.offset)| |c___ldv_list_add_#in~next.base| (store .cse2 .cse34 v___ldv_list_add_~new.offset_36)) |c___ldv_list_add_#in~new.base| .cse8) |c___ldv_list_add_#in~prev.base| .cse3)) (= (let ((.cse35 (let ((.cse36 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| (store .cse16 .cse34 (select .cse17 .cse34))))) (store .cse36 |c___ldv_list_add_#in~new.base| (store (store (select .cse36 |c___ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 |c___ldv_list_add_#in~next.base|) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c___ldv_list_add_#in~prev.base|))))) (store .cse35 |c___ldv_list_add_#in~prev.base| (store (select .cse35 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$.base|)))) (and .cse27 (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32)) (v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse37 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (= |c_#memory_$Pointer$.offset| (store (store (store |c_old(#memory_$Pointer$.offset)| |c___ldv_list_add_#in~next.base| (store .cse2 .cse37 v___ldv_list_add_~new.offset_36)) |c___ldv_list_add_#in~new.base| .cse8) |c___ldv_list_add_#in~prev.base| .cse3)) (= (let ((.cse38 (let ((.cse39 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| (store .cse16 .cse37 (select .cse17 .cse37))))) (store .cse39 |c___ldv_list_add_#in~new.base| (store (store (select .cse39 |c___ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 |c___ldv_list_add_#in~next.base|) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c___ldv_list_add_#in~prev.base|))))) (store .cse38 |c___ldv_list_add_#in~prev.base| (store (select .cse38 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$.base|))))) (and .cse27 (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32)) (v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse40 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (not (= v___ldv_list_add_~new.offset_36 .cse40)) (= |c_#memory_$Pointer$.offset| (store (store (store |c_old(#memory_$Pointer$.offset)| |c___ldv_list_add_#in~next.base| (store .cse2 .cse40 v___ldv_list_add_~new.offset_36)) |c___ldv_list_add_#in~new.base| .cse8) |c___ldv_list_add_#in~prev.base| .cse3)) (= (let ((.cse41 (let ((.cse42 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| (store .cse16 .cse40 (select .cse17 .cse40))))) (store .cse42 |c___ldv_list_add_#in~new.base| (store (store (select .cse42 |c___ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 |c___ldv_list_add_#in~next.base|) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c___ldv_list_add_#in~prev.base|))))) (store .cse41 |c___ldv_list_add_#in~prev.base| (store (select .cse41 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$.base|)))))) .cse12) (and (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32)) (v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse43 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (not (= |c___ldv_list_add_#in~prev.offset| .cse43)) (= |c_#memory_$Pointer$.offset| (store (store (store |c_old(#memory_$Pointer$.offset)| |c___ldv_list_add_#in~next.base| (store .cse2 .cse43 v___ldv_list_add_~new.offset_36)) |c___ldv_list_add_#in~new.base| .cse8) |c___ldv_list_add_#in~prev.base| .cse3)) (= (let ((.cse44 (let ((.cse45 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| (store .cse16 .cse43 (select .cse17 .cse43))))) (store .cse45 |c___ldv_list_add_#in~new.base| (store (store (select .cse45 |c___ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 |c___ldv_list_add_#in~next.base|) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c___ldv_list_add_#in~prev.base|))))) (store .cse44 |c___ldv_list_add_#in~prev.base| (store (select .cse44 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$.base|)))) .cse27) (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32))) (let ((.cse46 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (exists ((v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (and (not (= v___ldv_list_add_~new.offset_36 v___ldv_list_add_~next.offset_36)) (not (= v___ldv_list_add_~new.offset_36 .cse46)) (= |c_#memory_$Pointer$.offset| (store (store (store |c_old(#memory_$Pointer$.offset)| |c___ldv_list_add_#in~next.base| (store .cse2 .cse46 v___ldv_list_add_~new.offset_36)) |c___ldv_list_add_#in~new.base| .cse8) |c___ldv_list_add_#in~prev.base| .cse3)) (= (let ((.cse47 (let ((.cse48 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| (store .cse16 .cse46 (select .cse17 .cse46))))) (store .cse48 |c___ldv_list_add_#in~new.base| (store (store (select .cse48 |c___ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 |c___ldv_list_add_#in~next.base|) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c___ldv_list_add_#in~prev.base|))))) (store .cse47 |c___ldv_list_add_#in~prev.base| (store (select .cse47 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$.base|))) (not (= |c___ldv_list_add_#in~prev.offset| .cse46))))) (and .cse27 (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32)) (v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse49 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (not (= |c___ldv_list_add_#in~prev.offset| .cse49)) (not (= v___ldv_list_add_~new.offset_36 .cse49)) (= |c_#memory_$Pointer$.offset| (store (store (store |c_old(#memory_$Pointer$.offset)| |c___ldv_list_add_#in~next.base| (store .cse2 .cse49 v___ldv_list_add_~new.offset_36)) |c___ldv_list_add_#in~new.base| .cse8) |c___ldv_list_add_#in~prev.base| .cse3)) (= (let ((.cse50 (let ((.cse51 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~next.base| (store .cse16 .cse49 (select .cse17 .cse49))))) (store .cse51 |c___ldv_list_add_#in~new.base| (store (store (select .cse51 |c___ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 |c___ldv_list_add_#in~next.base|) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c___ldv_list_add_#in~prev.base|))))) (store .cse50 |c___ldv_list_add_#in~prev.base| (store (select .cse50 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$.base|)))))) .cse6) (and .cse11 (or (and .cse6 (exists ((v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse53 (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)))) (and (= |c_#memory_$Pointer$.base| (let ((.cse52 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~new.base| (store (store .cse5 v___ldv_list_add_~new.offset_36 |c___ldv_list_add_#in~next.base|) .cse53 |c___ldv_list_add_#in~prev.base|)))) (store .cse52 |c___ldv_list_add_#in~prev.base| (store (select .cse52 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|)))) (= |c_#memory_$Pointer$.offset| (store (store (store |c_old(#memory_$Pointer$.offset)| |c___ldv_list_add_#in~next.base| (store .cse2 .cse53 v___ldv_list_add_~new.offset_36)) |c___ldv_list_add_#in~new.base| .cse8) |c___ldv_list_add_#in~prev.base| .cse3)))))) (and .cse1 (exists ((v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse54 (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)))) (and (= (store (store |c_old(#memory_$Pointer$.offset)| |c___ldv_list_add_#in~next.base| (store .cse2 .cse54 v___ldv_list_add_~new.offset_36)) |c___ldv_list_add_#in~prev.base| .cse3) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (let ((.cse55 (store |c_old(#memory_$Pointer$.base)| |c___ldv_list_add_#in~new.base| (store (store .cse5 v___ldv_list_add_~new.offset_36 |c___ldv_list_add_#in~next.base|) .cse54 |c___ldv_list_add_#in~prev.base|)))) (store .cse55 |c___ldv_list_add_#in~prev.base| (store (select .cse55 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))))))))))))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (_ bv3 32))))) is different from false [2024-11-13 23:51:42,417 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse2 (select (select |c_old(#memory_$Pointer$.base)| |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset|))) (let ((.cse27 (= |c_ldv_list_add_#in~head.base| |c_ldv_list_add_#in~new.base|)) (.cse56 (= |c_ldv_list_add_#in~head.base| .cse2)) (.cse46 (= |c_ldv_list_add_#in~new.base| .cse2))) (let ((.cse11 (not .cse46)) (.cse1 (not .cse56)) (.cse9 (select |c_old(#memory_$Pointer$.base)| .cse2)) (.cse10 (select |c_#memory_$Pointer$.base| .cse2)) (.cse0 (not .cse27)) (.cse48 (select |c_old(#memory_$Pointer$.base)| |c_ldv_list_add_#in~new.base|)) (.cse3 (select |c_old(#memory_$Pointer$.offset)| .cse2)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ldv_list_add_#in~new.base|)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ldv_list_add_#in~head.base|))) (or (and .cse0 (or (and .cse1 (or (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32)) (v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse4 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (not (= v___ldv_list_add_~new.offset_36 v___ldv_list_add_~next.offset_36)) (= |c_#memory_$Pointer$.offset| (store (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 .cse4 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~new.base| .cse5) |c_ldv_list_add_#in~head.base| .cse6)) (not (= v___ldv_list_add_~new.offset_36 .cse4)) (= |c_#memory_$Pointer$.base| (let ((.cse7 (let ((.cse8 (store |c_old(#memory_$Pointer$.base)| .cse2 (store .cse9 .cse4 (select .cse10 .cse4))))) (store .cse8 |c_ldv_list_add_#in~new.base| (store (store (select .cse8 |c_ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|))))) (store .cse7 |c_ldv_list_add_#in~head.base| (store (select .cse7 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|))))))) (and .cse11 (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32)) (v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse12 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (= |c_#memory_$Pointer$.offset| (store (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 .cse12 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~new.base| .cse5) |c_ldv_list_add_#in~head.base| .cse6)) (not (= v___ldv_list_add_~new.offset_36 .cse12)) (= |c_#memory_$Pointer$.base| (let ((.cse13 (let ((.cse14 (store |c_old(#memory_$Pointer$.base)| .cse2 (store .cse9 .cse12 (select .cse10 .cse12))))) (store .cse14 |c_ldv_list_add_#in~new.base| (store (store (select .cse14 |c_ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|))))) (store .cse13 |c_ldv_list_add_#in~head.base| (store (select .cse13 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|)))))))) (and .cse11 (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32)) (v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse15 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (= |c_#memory_$Pointer$.offset| (store (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 .cse15 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~new.base| .cse5) |c_ldv_list_add_#in~head.base| .cse6)) (= |c_#memory_$Pointer$.base| (let ((.cse16 (let ((.cse17 (store |c_old(#memory_$Pointer$.base)| .cse2 (store .cse9 .cse15 (select .cse10 .cse15))))) (store .cse17 |c_ldv_list_add_#in~new.base| (store (store (select .cse17 |c_ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|))))) (store .cse16 |c_ldv_list_add_#in~head.base| (store (select .cse16 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|)))))))))) (and .cse11 (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32)) (v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse18 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (not (= |c_ldv_list_add_#in~head.offset| .cse18)) (= |c_#memory_$Pointer$.offset| (store (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 .cse18 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~new.base| .cse5) |c_ldv_list_add_#in~head.base| .cse6)) (not (= v___ldv_list_add_~new.offset_36 .cse18)) (= |c_#memory_$Pointer$.base| (let ((.cse19 (let ((.cse20 (store |c_old(#memory_$Pointer$.base)| .cse2 (store .cse9 .cse18 (select .cse10 .cse18))))) (store .cse20 |c_ldv_list_add_#in~new.base| (store (store (select .cse20 |c_ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|))))) (store .cse19 |c_ldv_list_add_#in~head.base| (store (select .cse19 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|)))))))) (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32))) (let ((.cse21 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (not (= |c_ldv_list_add_#in~head.offset| .cse21)) (exists ((v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (and (not (= v___ldv_list_add_~new.offset_36 v___ldv_list_add_~next.offset_36)) (= |c_#memory_$Pointer$.offset| (store (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 .cse21 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~new.base| .cse5) |c_ldv_list_add_#in~head.base| .cse6)) (not (= v___ldv_list_add_~new.offset_36 .cse21)) (= |c_#memory_$Pointer$.base| (let ((.cse22 (let ((.cse23 (store |c_old(#memory_$Pointer$.base)| .cse2 (store .cse9 .cse21 (select .cse10 .cse21))))) (store .cse23 |c_ldv_list_add_#in~new.base| (store (store (select .cse23 |c_ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|))))) (store .cse22 |c_ldv_list_add_#in~head.base| (store (select .cse22 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|))))))))) (and .cse11 (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32)) (v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse24 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (not (= |c_ldv_list_add_#in~head.offset| .cse24)) (= |c_#memory_$Pointer$.offset| (store (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 .cse24 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~new.base| .cse5) |c_ldv_list_add_#in~head.base| .cse6)) (= |c_#memory_$Pointer$.base| (let ((.cse25 (let ((.cse26 (store |c_old(#memory_$Pointer$.base)| .cse2 (store .cse9 .cse24 (select .cse10 .cse24))))) (store .cse26 |c_ldv_list_add_#in~new.base| (store (store (select .cse26 |c_ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|))))) (store .cse25 |c_ldv_list_add_#in~head.base| (store (select .cse25 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|)))))))))) (and .cse27 (or (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32))) (let ((.cse28 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (not (= |c_ldv_list_add_#in~head.offset| .cse28)) (exists ((v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (and (not (= v___ldv_list_add_~new.offset_36 v___ldv_list_add_~next.offset_36)) (not (= v___ldv_list_add_~new.offset_36 .cse28)) (= |c_#memory_$Pointer$.base| (let ((.cse29 (let ((.cse30 (store |c_old(#memory_$Pointer$.base)| .cse2 (store .cse9 .cse28 (select .cse10 .cse28))))) (store .cse30 |c_ldv_list_add_#in~new.base| (store (store (select .cse30 |c_ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|))))) (store .cse29 |c_ldv_list_add_#in~head.base| (store (select .cse29 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|)))) (= (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 .cse28 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~head.base| .cse6) |c_#memory_$Pointer$.offset|)))))) (and .cse11 (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32)) (v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse31 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (not (= |c_ldv_list_add_#in~head.offset| .cse31)) (not (= v___ldv_list_add_~new.offset_36 .cse31)) (= |c_#memory_$Pointer$.base| (let ((.cse32 (let ((.cse33 (store |c_old(#memory_$Pointer$.base)| .cse2 (store .cse9 .cse31 (select .cse10 .cse31))))) (store .cse33 |c_ldv_list_add_#in~new.base| (store (store (select .cse33 |c_ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|))))) (store .cse32 |c_ldv_list_add_#in~head.base| (store (select .cse32 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|)))) (= (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 .cse31 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~head.base| .cse6) |c_#memory_$Pointer$.offset|))))) (and .cse11 (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32)) (v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse34 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (not (= |c_ldv_list_add_#in~head.offset| .cse34)) (= |c_#memory_$Pointer$.base| (let ((.cse35 (let ((.cse36 (store |c_old(#memory_$Pointer$.base)| .cse2 (store .cse9 .cse34 (select .cse10 .cse34))))) (store .cse36 |c_ldv_list_add_#in~new.base| (store (store (select .cse36 |c_ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|))))) (store .cse35 |c_ldv_list_add_#in~head.base| (store (select .cse35 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|)))) (= (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 .cse34 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~head.base| .cse6) |c_#memory_$Pointer$.offset|))))) (and .cse1 (or (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32)) (v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse39 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (= |c_#memory_$Pointer$.base| (let ((.cse37 (let ((.cse38 (store |c_old(#memory_$Pointer$.base)| .cse2 (store .cse9 .cse39 (select .cse10 .cse39))))) (store .cse38 |c_ldv_list_add_#in~new.base| (store (store (select .cse38 |c_ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|))))) (store .cse37 |c_ldv_list_add_#in~head.base| (store (select .cse37 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|)))) (= (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 .cse39 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~head.base| .cse6) |c_#memory_$Pointer$.offset|)))) (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32)) (v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse40 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (not (= v___ldv_list_add_~new.offset_36 .cse40)) (= |c_#memory_$Pointer$.base| (let ((.cse41 (let ((.cse42 (store |c_old(#memory_$Pointer$.base)| .cse2 (store .cse9 .cse40 (select .cse10 .cse40))))) (store .cse42 |c_ldv_list_add_#in~new.base| (store (store (select .cse42 |c_ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|))))) (store .cse41 |c_ldv_list_add_#in~head.base| (store (select .cse41 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|)))) (= (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 .cse40 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~head.base| .cse6) |c_#memory_$Pointer$.offset|)))) (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32)) (v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse43 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (not (= v___ldv_list_add_~new.offset_36 v___ldv_list_add_~next.offset_36)) (not (= v___ldv_list_add_~new.offset_36 .cse43)) (= |c_#memory_$Pointer$.base| (let ((.cse44 (let ((.cse45 (store |c_old(#memory_$Pointer$.base)| .cse2 (store .cse9 .cse43 (select .cse10 .cse43))))) (store .cse45 |c_ldv_list_add_#in~new.base| (store (store (select .cse45 |c_ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|))))) (store .cse44 |c_ldv_list_add_#in~head.base| (store (select .cse44 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|)))) (= (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 .cse43 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~head.base| .cse6) |c_#memory_$Pointer$.offset|)))))))) (and .cse46 (or (and .cse0 (exists ((v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (and (= (let ((.cse47 (store |c_old(#memory_$Pointer$.base)| |c_ldv_list_add_#in~new.base| (store (store .cse48 v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|)))) (store .cse47 |c_ldv_list_add_#in~head.base| (store (select .cse47 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$.base|) (= (store (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 v___ldv_list_add_~new.offset_36 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~new.base| .cse5) |c_ldv_list_add_#in~head.base| .cse6) |c_#memory_$Pointer$.offset|)))) (and .cse27 (exists ((v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (and (= (let ((.cse49 (store |c_old(#memory_$Pointer$.base)| |c_ldv_list_add_#in~new.base| (store (store .cse48 v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|)))) (store .cse49 |c_ldv_list_add_#in~head.base| (store (select .cse49 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$.base|) (= |c_#memory_$Pointer$.offset| (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 v___ldv_list_add_~new.offset_36 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~head.base| .cse6))))))) (and (or (and .cse0 (exists ((v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse50 (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)))) (and (= |c_#memory_$Pointer$.offset| (store (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 .cse50 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~new.base| .cse5) |c_ldv_list_add_#in~head.base| .cse6)) (= (let ((.cse51 (store |c_old(#memory_$Pointer$.base)| |c_ldv_list_add_#in~new.base| (store (store .cse48 v___ldv_list_add_~new.offset_36 .cse2) .cse50 |c_ldv_list_add_#in~head.base|)))) (store .cse51 |c_ldv_list_add_#in~head.base| (store (select .cse51 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$.base|))))) (and .cse27 (exists ((v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse52 (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)))) (and (= |c_#memory_$Pointer$.offset| (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 .cse52 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~head.base| .cse6)) (= (let ((.cse53 (store |c_old(#memory_$Pointer$.base)| |c_ldv_list_add_#in~new.base| (store (store .cse48 v___ldv_list_add_~new.offset_36 .cse2) .cse52 |c_ldv_list_add_#in~head.base|)))) (store .cse53 |c_ldv_list_add_#in~head.base| (store (select .cse53 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$.base|)))))) .cse46) (and (or (and .cse27 (exists ((v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (and (= (let ((.cse54 (store |c_old(#memory_$Pointer$.base)| |c_ldv_list_add_#in~new.base| (store (store .cse48 v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|)))) (store .cse54 |c_ldv_list_add_#in~head.base| (store (select .cse54 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$.base|) (= |c_#memory_$Pointer$.offset| (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 |c_ldv_list_add_#in~head.offset| v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~head.base| .cse6))))) (and .cse0 (exists ((v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (and (= (let ((.cse55 (store |c_old(#memory_$Pointer$.base)| |c_ldv_list_add_#in~new.base| (store (store .cse48 v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|)))) (store .cse55 |c_ldv_list_add_#in~head.base| (store (select .cse55 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$.base|) (= (store (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 |c_ldv_list_add_#in~head.offset| v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~new.base| .cse5) |c_ldv_list_add_#in~head.base| .cse6) |c_#memory_$Pointer$.offset|))))) .cse56))))) (= (_ bv3 32) |c_~#mutexes~0.base|) (= |c_~#drvlist~0.base| (_ bv4 32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (_ bv3 32))))) is different from false [2024-11-13 23:51:42,435 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse2 (select (select |c_old(#memory_$Pointer$.base)| |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset|))) (let ((.cse27 (= |c_ldv_list_add_#in~head.base| |c_ldv_list_add_#in~new.base|)) (.cse56 (= |c_ldv_list_add_#in~head.base| .cse2)) (.cse46 (= |c_ldv_list_add_#in~new.base| .cse2))) (let ((.cse11 (not .cse46)) (.cse1 (not .cse56)) (.cse9 (select |c_old(#memory_$Pointer$.base)| .cse2)) (.cse10 (select |c_#memory_$Pointer$.base| .cse2)) (.cse0 (not .cse27)) (.cse48 (select |c_old(#memory_$Pointer$.base)| |c_ldv_list_add_#in~new.base|)) (.cse3 (select |c_old(#memory_$Pointer$.offset)| .cse2)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ldv_list_add_#in~new.base|)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ldv_list_add_#in~head.base|))) (or (and .cse0 (or (and .cse1 (or (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32)) (v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse4 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (not (= v___ldv_list_add_~new.offset_36 v___ldv_list_add_~next.offset_36)) (= |c_#memory_$Pointer$.offset| (store (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 .cse4 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~new.base| .cse5) |c_ldv_list_add_#in~head.base| .cse6)) (not (= v___ldv_list_add_~new.offset_36 .cse4)) (= |c_#memory_$Pointer$.base| (let ((.cse7 (let ((.cse8 (store |c_old(#memory_$Pointer$.base)| .cse2 (store .cse9 .cse4 (select .cse10 .cse4))))) (store .cse8 |c_ldv_list_add_#in~new.base| (store (store (select .cse8 |c_ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|))))) (store .cse7 |c_ldv_list_add_#in~head.base| (store (select .cse7 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|))))))) (and .cse11 (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32)) (v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse12 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (= |c_#memory_$Pointer$.offset| (store (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 .cse12 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~new.base| .cse5) |c_ldv_list_add_#in~head.base| .cse6)) (not (= v___ldv_list_add_~new.offset_36 .cse12)) (= |c_#memory_$Pointer$.base| (let ((.cse13 (let ((.cse14 (store |c_old(#memory_$Pointer$.base)| .cse2 (store .cse9 .cse12 (select .cse10 .cse12))))) (store .cse14 |c_ldv_list_add_#in~new.base| (store (store (select .cse14 |c_ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|))))) (store .cse13 |c_ldv_list_add_#in~head.base| (store (select .cse13 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|)))))))) (and .cse11 (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32)) (v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse15 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (= |c_#memory_$Pointer$.offset| (store (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 .cse15 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~new.base| .cse5) |c_ldv_list_add_#in~head.base| .cse6)) (= |c_#memory_$Pointer$.base| (let ((.cse16 (let ((.cse17 (store |c_old(#memory_$Pointer$.base)| .cse2 (store .cse9 .cse15 (select .cse10 .cse15))))) (store .cse17 |c_ldv_list_add_#in~new.base| (store (store (select .cse17 |c_ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|))))) (store .cse16 |c_ldv_list_add_#in~head.base| (store (select .cse16 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|)))))))))) (and .cse11 (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32)) (v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse18 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (not (= |c_ldv_list_add_#in~head.offset| .cse18)) (= |c_#memory_$Pointer$.offset| (store (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 .cse18 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~new.base| .cse5) |c_ldv_list_add_#in~head.base| .cse6)) (not (= v___ldv_list_add_~new.offset_36 .cse18)) (= |c_#memory_$Pointer$.base| (let ((.cse19 (let ((.cse20 (store |c_old(#memory_$Pointer$.base)| .cse2 (store .cse9 .cse18 (select .cse10 .cse18))))) (store .cse20 |c_ldv_list_add_#in~new.base| (store (store (select .cse20 |c_ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|))))) (store .cse19 |c_ldv_list_add_#in~head.base| (store (select .cse19 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|)))))))) (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32))) (let ((.cse21 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (not (= |c_ldv_list_add_#in~head.offset| .cse21)) (exists ((v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (and (not (= v___ldv_list_add_~new.offset_36 v___ldv_list_add_~next.offset_36)) (= |c_#memory_$Pointer$.offset| (store (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 .cse21 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~new.base| .cse5) |c_ldv_list_add_#in~head.base| .cse6)) (not (= v___ldv_list_add_~new.offset_36 .cse21)) (= |c_#memory_$Pointer$.base| (let ((.cse22 (let ((.cse23 (store |c_old(#memory_$Pointer$.base)| .cse2 (store .cse9 .cse21 (select .cse10 .cse21))))) (store .cse23 |c_ldv_list_add_#in~new.base| (store (store (select .cse23 |c_ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|))))) (store .cse22 |c_ldv_list_add_#in~head.base| (store (select .cse22 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|))))))))) (and .cse11 (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32)) (v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse24 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (not (= |c_ldv_list_add_#in~head.offset| .cse24)) (= |c_#memory_$Pointer$.offset| (store (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 .cse24 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~new.base| .cse5) |c_ldv_list_add_#in~head.base| .cse6)) (= |c_#memory_$Pointer$.base| (let ((.cse25 (let ((.cse26 (store |c_old(#memory_$Pointer$.base)| .cse2 (store .cse9 .cse24 (select .cse10 .cse24))))) (store .cse26 |c_ldv_list_add_#in~new.base| (store (store (select .cse26 |c_ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|))))) (store .cse25 |c_ldv_list_add_#in~head.base| (store (select .cse25 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|)))))))))) (and .cse27 (or (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32))) (let ((.cse28 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (not (= |c_ldv_list_add_#in~head.offset| .cse28)) (exists ((v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (and (not (= v___ldv_list_add_~new.offset_36 v___ldv_list_add_~next.offset_36)) (not (= v___ldv_list_add_~new.offset_36 .cse28)) (= |c_#memory_$Pointer$.base| (let ((.cse29 (let ((.cse30 (store |c_old(#memory_$Pointer$.base)| .cse2 (store .cse9 .cse28 (select .cse10 .cse28))))) (store .cse30 |c_ldv_list_add_#in~new.base| (store (store (select .cse30 |c_ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|))))) (store .cse29 |c_ldv_list_add_#in~head.base| (store (select .cse29 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|)))) (= (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 .cse28 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~head.base| .cse6) |c_#memory_$Pointer$.offset|)))))) (and .cse11 (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32)) (v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse31 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (not (= |c_ldv_list_add_#in~head.offset| .cse31)) (not (= v___ldv_list_add_~new.offset_36 .cse31)) (= |c_#memory_$Pointer$.base| (let ((.cse32 (let ((.cse33 (store |c_old(#memory_$Pointer$.base)| .cse2 (store .cse9 .cse31 (select .cse10 .cse31))))) (store .cse33 |c_ldv_list_add_#in~new.base| (store (store (select .cse33 |c_ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|))))) (store .cse32 |c_ldv_list_add_#in~head.base| (store (select .cse32 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|)))) (= (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 .cse31 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~head.base| .cse6) |c_#memory_$Pointer$.offset|))))) (and .cse11 (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32)) (v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse34 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (not (= |c_ldv_list_add_#in~head.offset| .cse34)) (= |c_#memory_$Pointer$.base| (let ((.cse35 (let ((.cse36 (store |c_old(#memory_$Pointer$.base)| .cse2 (store .cse9 .cse34 (select .cse10 .cse34))))) (store .cse36 |c_ldv_list_add_#in~new.base| (store (store (select .cse36 |c_ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|))))) (store .cse35 |c_ldv_list_add_#in~head.base| (store (select .cse35 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|)))) (= (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 .cse34 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~head.base| .cse6) |c_#memory_$Pointer$.offset|))))) (and .cse1 (or (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32)) (v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse39 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (= |c_#memory_$Pointer$.base| (let ((.cse37 (let ((.cse38 (store |c_old(#memory_$Pointer$.base)| .cse2 (store .cse9 .cse39 (select .cse10 .cse39))))) (store .cse38 |c_ldv_list_add_#in~new.base| (store (store (select .cse38 |c_ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|))))) (store .cse37 |c_ldv_list_add_#in~head.base| (store (select .cse37 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|)))) (= (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 .cse39 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~head.base| .cse6) |c_#memory_$Pointer$.offset|)))) (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32)) (v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse40 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (not (= v___ldv_list_add_~new.offset_36 .cse40)) (= |c_#memory_$Pointer$.base| (let ((.cse41 (let ((.cse42 (store |c_old(#memory_$Pointer$.base)| .cse2 (store .cse9 .cse40 (select .cse10 .cse40))))) (store .cse42 |c_ldv_list_add_#in~new.base| (store (store (select .cse42 |c_ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|))))) (store .cse41 |c_ldv_list_add_#in~head.base| (store (select .cse41 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|)))) (= (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 .cse40 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~head.base| .cse6) |c_#memory_$Pointer$.offset|)))) (exists ((v___ldv_list_add_~next.offset_36 (_ BitVec 32)) (v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse43 (bvadd (_ bv4 32) v___ldv_list_add_~next.offset_36))) (and (not (= v___ldv_list_add_~new.offset_36 v___ldv_list_add_~next.offset_36)) (not (= v___ldv_list_add_~new.offset_36 .cse43)) (= |c_#memory_$Pointer$.base| (let ((.cse44 (let ((.cse45 (store |c_old(#memory_$Pointer$.base)| .cse2 (store .cse9 .cse43 (select .cse10 .cse43))))) (store .cse45 |c_ldv_list_add_#in~new.base| (store (store (select .cse45 |c_ldv_list_add_#in~new.base|) v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|))))) (store .cse44 |c_ldv_list_add_#in~head.base| (store (select .cse44 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|)))) (= (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 .cse43 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~head.base| .cse6) |c_#memory_$Pointer$.offset|)))))))) (and .cse46 (or (and .cse0 (exists ((v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (and (= (let ((.cse47 (store |c_old(#memory_$Pointer$.base)| |c_ldv_list_add_#in~new.base| (store (store .cse48 v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|)))) (store .cse47 |c_ldv_list_add_#in~head.base| (store (select .cse47 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$.base|) (= (store (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 v___ldv_list_add_~new.offset_36 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~new.base| .cse5) |c_ldv_list_add_#in~head.base| .cse6) |c_#memory_$Pointer$.offset|)))) (and .cse27 (exists ((v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (and (= (let ((.cse49 (store |c_old(#memory_$Pointer$.base)| |c_ldv_list_add_#in~new.base| (store (store .cse48 v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|)))) (store .cse49 |c_ldv_list_add_#in~head.base| (store (select .cse49 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$.base|) (= |c_#memory_$Pointer$.offset| (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 v___ldv_list_add_~new.offset_36 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~head.base| .cse6))))))) (and (or (and .cse0 (exists ((v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse50 (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)))) (and (= |c_#memory_$Pointer$.offset| (store (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 .cse50 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~new.base| .cse5) |c_ldv_list_add_#in~head.base| .cse6)) (= (let ((.cse51 (store |c_old(#memory_$Pointer$.base)| |c_ldv_list_add_#in~new.base| (store (store .cse48 v___ldv_list_add_~new.offset_36 .cse2) .cse50 |c_ldv_list_add_#in~head.base|)))) (store .cse51 |c_ldv_list_add_#in~head.base| (store (select .cse51 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$.base|))))) (and .cse27 (exists ((v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (let ((.cse52 (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)))) (and (= |c_#memory_$Pointer$.offset| (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 .cse52 v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~head.base| .cse6)) (= (let ((.cse53 (store |c_old(#memory_$Pointer$.base)| |c_ldv_list_add_#in~new.base| (store (store .cse48 v___ldv_list_add_~new.offset_36 .cse2) .cse52 |c_ldv_list_add_#in~head.base|)))) (store .cse53 |c_ldv_list_add_#in~head.base| (store (select .cse53 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$.base|)))))) .cse46) (and (or (and .cse27 (exists ((v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (and (= (let ((.cse54 (store |c_old(#memory_$Pointer$.base)| |c_ldv_list_add_#in~new.base| (store (store .cse48 v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|)))) (store .cse54 |c_ldv_list_add_#in~head.base| (store (select .cse54 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$.base|) (= |c_#memory_$Pointer$.offset| (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 |c_ldv_list_add_#in~head.offset| v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~head.base| .cse6))))) (and .cse0 (exists ((v___ldv_list_add_~new.offset_36 (_ BitVec 32))) (and (= (let ((.cse55 (store |c_old(#memory_$Pointer$.base)| |c_ldv_list_add_#in~new.base| (store (store .cse48 v___ldv_list_add_~new.offset_36 .cse2) (bvadd v___ldv_list_add_~new.offset_36 (_ bv4 32)) |c_ldv_list_add_#in~head.base|)))) (store .cse55 |c_ldv_list_add_#in~head.base| (store (select .cse55 |c_ldv_list_add_#in~head.base|) |c_ldv_list_add_#in~head.offset| |c_ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$.base|) (= (store (store (store |c_old(#memory_$Pointer$.offset)| .cse2 (store .cse3 |c_ldv_list_add_#in~head.offset| v___ldv_list_add_~new.offset_36)) |c_ldv_list_add_#in~new.base| .cse5) |c_ldv_list_add_#in~head.base| .cse6) |c_#memory_$Pointer$.offset|))))) .cse56))))) (= (_ bv3 32) |c_~#mutexes~0.base|) (= |c_~#drvlist~0.base| (_ bv4 32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (_ bv3 32))))) is different from true