./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-sorted-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-sorted-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:18:48,168 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:18:48,236 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 02:18:48,240 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:18:48,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:18:48,264 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:18:48,265 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:18:48,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:18:48,266 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:18:48,267 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:18:48,267 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:18:48,268 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:18:48,269 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:18:48,269 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:18:48,270 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:18:48,270 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:18:48,271 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:18:48,271 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:18:48,272 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:18:48,272 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:18:48,273 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 02:18:48,275 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 02:18:48,276 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 02:18:48,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:18:48,277 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:18:48,277 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:18:48,277 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:18:48,278 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:18:48,278 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:18:48,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:18:48,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:18:48,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:18:48,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:18:48,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:18:48,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:18:48,280 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:18:48,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:18:48,281 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:18:48,281 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:18:48,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:18:48,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:18:48,281 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 [2023-11-29 02:18:48,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:18:48,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:18:48,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:18:48,527 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:18:48,527 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:18:48,528 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/forester-heap/dll-sorted-2.i [2023-11-29 02:18:51,362 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:18:51,586 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:18:51,586 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/sv-benchmarks/c/forester-heap/dll-sorted-2.i [2023-11-29 02:18:51,602 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/data/61a7b9587/5ccc4daf16434e50a5d6b7221868221e/FLAG86ed7d06d [2023-11-29 02:18:51,613 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/data/61a7b9587/5ccc4daf16434e50a5d6b7221868221e [2023-11-29 02:18:51,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:18:51,617 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:18:51,618 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:18:51,618 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:18:51,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:18:51,624 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:18:51" (1/1) ... [2023-11-29 02:18:51,625 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41b49f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:51, skipping insertion in model container [2023-11-29 02:18:51,625 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:18:51" (1/1) ... [2023-11-29 02:18:51,676 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:18:51,968 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:18:51,980 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:18:52,027 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:18:52,052 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:18:52,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:52 WrapperNode [2023-11-29 02:18:52,052 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:18:52,053 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:18:52,053 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:18:52,054 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:18:52,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:52" (1/1) ... [2023-11-29 02:18:52,073 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:52" (1/1) ... [2023-11-29 02:18:52,097 INFO L138 Inliner]: procedures = 119, calls = 51, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 199 [2023-11-29 02:18:52,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:18:52,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:18:52,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:18:52,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:18:52,107 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:52" (1/1) ... [2023-11-29 02:18:52,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:52" (1/1) ... [2023-11-29 02:18:52,112 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:52" (1/1) ... [2023-11-29 02:18:52,131 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 15 writes are split as follows [0, 15]. [2023-11-29 02:18:52,131 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:52" (1/1) ... [2023-11-29 02:18:52,132 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:52" (1/1) ... [2023-11-29 02:18:52,142 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:52" (1/1) ... [2023-11-29 02:18:52,147 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:52" (1/1) ... [2023-11-29 02:18:52,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:52" (1/1) ... [2023-11-29 02:18:52,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:52" (1/1) ... [2023-11-29 02:18:52,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:18:52,157 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:18:52,157 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:18:52,157 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:18:52,158 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:52" (1/1) ... [2023-11-29 02:18:52,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:18:52,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:18:52,186 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:18:52,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:18:52,222 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-29 02:18:52,223 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-29 02:18:52,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 02:18:52,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 02:18:52,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 02:18:52,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 02:18:52,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 02:18:52,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:18:52,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 02:18:52,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 02:18:52,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 02:18:52,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 02:18:52,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 02:18:52,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 02:18:52,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 02:18:52,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:18:52,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:18:52,347 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:18:52,349 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:18:52,773 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:18:52,868 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:18:52,869 INFO L309 CfgBuilder]: Removed 18 assume(true) statements. [2023-11-29 02:18:52,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:18:52 BoogieIcfgContainer [2023-11-29 02:18:52,870 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:18:52,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:18:52,873 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:18:52,877 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:18:52,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:18:51" (1/3) ... [2023-11-29 02:18:52,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20af5176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:18:52, skipping insertion in model container [2023-11-29 02:18:52,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:18:52" (2/3) ... [2023-11-29 02:18:52,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20af5176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:18:52, skipping insertion in model container [2023-11-29 02:18:52,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:18:52" (3/3) ... [2023-11-29 02:18:52,880 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-sorted-2.i [2023-11-29 02:18:52,898 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:18:52,899 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 75 error locations. [2023-11-29 02:18:52,943 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:18:52,949 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@5d63bd74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:18:52,949 INFO L358 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2023-11-29 02:18:52,953 INFO L276 IsEmpty]: Start isEmpty. Operand has 164 states, 81 states have (on average 2.382716049382716) internal successors, (193), 156 states have internal predecessors, (193), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 02:18:52,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 02:18:52,958 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:18:52,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 02:18:52,959 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:18:52,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:18:52,963 INFO L85 PathProgramCache]: Analyzing trace with hash 13219, now seen corresponding path program 1 times [2023-11-29 02:18:52,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:18:52,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462819060] [2023-11-29 02:18:52,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:18:52,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:18:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:18:53,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:18:53,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462819060] [2023-11-29 02:18:53,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462819060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:18:53,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:18:53,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:18:53,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610227095] [2023-11-29 02:18:53,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:18:53,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:18:53,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:18:53,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:18:53,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:18:53,188 INFO L87 Difference]: Start difference. First operand has 164 states, 81 states have (on average 2.382716049382716) internal successors, (193), 156 states have internal predecessors, (193), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:18:53,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:18:53,367 INFO L93 Difference]: Finished difference Result 157 states and 174 transitions. [2023-11-29 02:18:53,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:18:53,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-29 02:18:53,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:18:53,379 INFO L225 Difference]: With dead ends: 157 [2023-11-29 02:18:53,379 INFO L226 Difference]: Without dead ends: 156 [2023-11-29 02:18:53,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:18:53,385 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 147 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:18:53,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 99 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:18:53,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-11-29 02:18:53,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2023-11-29 02:18:53,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 74 states have (on average 2.189189189189189) internal successors, (162), 150 states have internal predecessors, (162), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:18:53,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 168 transitions. [2023-11-29 02:18:53,441 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 168 transitions. Word has length 2 [2023-11-29 02:18:53,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:18:53,442 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 168 transitions. [2023-11-29 02:18:53,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:18:53,443 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 168 transitions. [2023-11-29 02:18:53,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 02:18:53,443 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:18:53,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 02:18:53,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 02:18:53,444 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:18:53,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:18:53,445 INFO L85 PathProgramCache]: Analyzing trace with hash 13220, now seen corresponding path program 1 times [2023-11-29 02:18:53,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:18:53,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76552024] [2023-11-29 02:18:53,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:18:53,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:18:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:53,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:18:53,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:18:53,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76552024] [2023-11-29 02:18:53,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76552024] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:18:53,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:18:53,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:18:53,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772473613] [2023-11-29 02:18:53,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:18:53,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:18:53,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:18:53,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:18:53,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:18:53,546 INFO L87 Difference]: Start difference. First operand 152 states and 168 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:18:53,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:18:53,696 INFO L93 Difference]: Finished difference Result 153 states and 169 transitions. [2023-11-29 02:18:53,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:18:53,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-29 02:18:53,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:18:53,698 INFO L225 Difference]: With dead ends: 153 [2023-11-29 02:18:53,698 INFO L226 Difference]: Without dead ends: 153 [2023-11-29 02:18:53,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:18:53,700 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 144 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:18:53,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 99 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:18:53,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-11-29 02:18:53,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2023-11-29 02:18:53,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 74 states have (on average 2.1486486486486487) internal successors, (159), 147 states have internal predecessors, (159), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:18:53,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 165 transitions. [2023-11-29 02:18:53,714 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 165 transitions. Word has length 2 [2023-11-29 02:18:53,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:18:53,714 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 165 transitions. [2023-11-29 02:18:53,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:18:53,714 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 165 transitions. [2023-11-29 02:18:53,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 02:18:53,715 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:18:53,715 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:18:53,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 02:18:53,716 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:18:53,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:18:53,716 INFO L85 PathProgramCache]: Analyzing trace with hash 488403782, now seen corresponding path program 1 times [2023-11-29 02:18:53,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:18:53,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27670598] [2023-11-29 02:18:53,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:18:53,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:18:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:53,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:18:53,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:18:53,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27670598] [2023-11-29 02:18:53,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27670598] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:18:53,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:18:53,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:18:53,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894420639] [2023-11-29 02:18:53,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:18:53,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:18:53,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:18:53,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:18:53,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:18:53,867 INFO L87 Difference]: Start difference. First operand 149 states and 165 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:18:54,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:18:54,078 INFO L93 Difference]: Finished difference Result 155 states and 174 transitions. [2023-11-29 02:18:54,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:18:54,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 02:18:54,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:18:54,080 INFO L225 Difference]: With dead ends: 155 [2023-11-29 02:18:54,081 INFO L226 Difference]: Without dead ends: 155 [2023-11-29 02:18:54,081 INFO L412 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 [2023-11-29 02:18:54,082 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 252 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:18:54,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 75 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:18:54,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-11-29 02:18:54,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2023-11-29 02:18:54,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 87 states have (on average 1.896551724137931) internal successors, (165), 142 states have internal predecessors, (165), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:18:54,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 171 transitions. [2023-11-29 02:18:54,093 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 171 transitions. Word has length 7 [2023-11-29 02:18:54,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:18:54,094 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 171 transitions. [2023-11-29 02:18:54,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:18:54,094 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 171 transitions. [2023-11-29 02:18:54,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 02:18:54,095 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:18:54,095 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:18:54,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 02:18:54,095 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:18:54,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:18:54,096 INFO L85 PathProgramCache]: Analyzing trace with hash 488403783, now seen corresponding path program 1 times [2023-11-29 02:18:54,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:18:54,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776784892] [2023-11-29 02:18:54,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:18:54,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:18:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:54,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:18:54,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:18:54,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776784892] [2023-11-29 02:18:54,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776784892] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:18:54,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:18:54,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:18:54,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095290393] [2023-11-29 02:18:54,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:18:54,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:18:54,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:18:54,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:18:54,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:18:54,310 INFO L87 Difference]: Start difference. First operand 144 states and 171 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:18:54,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:18:54,630 INFO L93 Difference]: Finished difference Result 211 states and 246 transitions. [2023-11-29 02:18:54,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:18:54,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 02:18:54,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:18:54,632 INFO L225 Difference]: With dead ends: 211 [2023-11-29 02:18:54,632 INFO L226 Difference]: Without dead ends: 211 [2023-11-29 02:18:54,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:18:54,635 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 546 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:18:54,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 105 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:18:54,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-11-29 02:18:54,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 187. [2023-11-29 02:18:54,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 130 states have (on average 1.7769230769230768) internal successors, (231), 185 states have internal predecessors, (231), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:18:54,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 237 transitions. [2023-11-29 02:18:54,648 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 237 transitions. Word has length 7 [2023-11-29 02:18:54,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:18:54,648 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 237 transitions. [2023-11-29 02:18:54,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:18:54,648 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 237 transitions. [2023-11-29 02:18:54,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 02:18:54,649 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:18:54,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:18:54,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 02:18:54,650 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:18:54,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:18:54,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1204949237, now seen corresponding path program 1 times [2023-11-29 02:18:54,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:18:54,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359150836] [2023-11-29 02:18:54,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:18:54,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:18:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:54,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:18:54,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:18:54,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359150836] [2023-11-29 02:18:54,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359150836] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:18:54,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:18:54,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:18:54,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535629699] [2023-11-29 02:18:54,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:18:54,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:18:54,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:18:54,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:18:54,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:18:54,758 INFO L87 Difference]: Start difference. First operand 187 states and 237 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:18:54,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:18:54,937 INFO L93 Difference]: Finished difference Result 186 states and 235 transitions. [2023-11-29 02:18:54,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:18:54,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-29 02:18:54,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:18:54,939 INFO L225 Difference]: With dead ends: 186 [2023-11-29 02:18:54,939 INFO L226 Difference]: Without dead ends: 186 [2023-11-29 02:18:54,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:18:54,941 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 6 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:18:54,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 356 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:18:54,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-11-29 02:18:54,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2023-11-29 02:18:54,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 130 states have (on average 1.7615384615384615) internal successors, (229), 184 states have internal predecessors, (229), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:18:54,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 235 transitions. [2023-11-29 02:18:54,950 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 235 transitions. Word has length 9 [2023-11-29 02:18:54,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:18:54,951 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 235 transitions. [2023-11-29 02:18:54,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:18:54,951 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 235 transitions. [2023-11-29 02:18:54,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 02:18:54,952 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:18:54,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:18:54,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 02:18:54,952 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:18:54,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:18:54,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1204949238, now seen corresponding path program 1 times [2023-11-29 02:18:54,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:18:54,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353235286] [2023-11-29 02:18:54,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:18:54,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:18:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:18:55,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:18:55,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353235286] [2023-11-29 02:18:55,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353235286] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:18:55,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:18:55,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:18:55,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608868035] [2023-11-29 02:18:55,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:18:55,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:18:55,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:18:55,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:18:55,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:18:55,134 INFO L87 Difference]: Start difference. First operand 186 states and 235 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:18:55,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:18:55,339 INFO L93 Difference]: Finished difference Result 185 states and 233 transitions. [2023-11-29 02:18:55,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:18:55,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-29 02:18:55,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:18:55,342 INFO L225 Difference]: With dead ends: 185 [2023-11-29 02:18:55,343 INFO L226 Difference]: Without dead ends: 185 [2023-11-29 02:18:55,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:18:55,344 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 3 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:18:55,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 334 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:18:55,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-11-29 02:18:55,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2023-11-29 02:18:55,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 130 states have (on average 1.7461538461538462) internal successors, (227), 183 states have internal predecessors, (227), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:18:55,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 233 transitions. [2023-11-29 02:18:55,351 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 233 transitions. Word has length 9 [2023-11-29 02:18:55,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:18:55,351 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 233 transitions. [2023-11-29 02:18:55,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:18:55,351 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 233 transitions. [2023-11-29 02:18:55,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 02:18:55,352 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:18:55,352 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:18:55,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 02:18:55,352 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:18:55,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:18:55,353 INFO L85 PathProgramCache]: Analyzing trace with hash -2039868593, now seen corresponding path program 1 times [2023-11-29 02:18:55,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:18:55,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175177823] [2023-11-29 02:18:55,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:18:55,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:18:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:55,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:18:55,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:18:55,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175177823] [2023-11-29 02:18:55,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175177823] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:18:55,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:18:55,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:18:55,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093101094] [2023-11-29 02:18:55,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:18:55,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:18:55,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:18:55,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:18:55,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:18:55,381 INFO L87 Difference]: Start difference. First operand 185 states and 233 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:18:55,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:18:55,433 INFO L93 Difference]: Finished difference Result 222 states and 274 transitions. [2023-11-29 02:18:55,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:18:55,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-29 02:18:55,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:18:55,435 INFO L225 Difference]: With dead ends: 222 [2023-11-29 02:18:55,435 INFO L226 Difference]: Without dead ends: 222 [2023-11-29 02:18:55,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:18:55,436 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 101 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:18:55,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 180 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:18:55,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-11-29 02:18:55,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 194. [2023-11-29 02:18:55,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 139 states have (on average 1.7338129496402879) internal successors, (241), 192 states have internal predecessors, (241), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:18:55,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 247 transitions. [2023-11-29 02:18:55,445 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 247 transitions. Word has length 11 [2023-11-29 02:18:55,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:18:55,445 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 247 transitions. [2023-11-29 02:18:55,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:18:55,445 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 247 transitions. [2023-11-29 02:18:55,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 02:18:55,446 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:18:55,446 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:18:55,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 02:18:55,446 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:18:55,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:18:55,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1684616548, now seen corresponding path program 1 times [2023-11-29 02:18:55,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:18:55,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719745143] [2023-11-29 02:18:55,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:18:55,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:18:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:55,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:18:55,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:18:55,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719745143] [2023-11-29 02:18:55,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719745143] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:18:55,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:18:55,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:18:55,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114920063] [2023-11-29 02:18:55,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:18:55,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:18:55,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:18:55,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:18:55,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:18:55,665 INFO L87 Difference]: Start difference. First operand 194 states and 247 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:18:56,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:18:56,026 INFO L93 Difference]: Finished difference Result 201 states and 248 transitions. [2023-11-29 02:18:56,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:18:56,027 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 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 11 [2023-11-29 02:18:56,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:18:56,028 INFO L225 Difference]: With dead ends: 201 [2023-11-29 02:18:56,028 INFO L226 Difference]: Without dead ends: 201 [2023-11-29 02:18:56,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-29 02:18:56,029 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 245 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:18:56,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 222 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:18:56,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-11-29 02:18:56,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 193. [2023-11-29 02:18:56,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 139 states have (on average 1.7194244604316546) internal successors, (239), 191 states have internal predecessors, (239), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:18:56,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 245 transitions. [2023-11-29 02:18:56,036 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 245 transitions. Word has length 11 [2023-11-29 02:18:56,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:18:56,036 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 245 transitions. [2023-11-29 02:18:56,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:18:56,037 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 245 transitions. [2023-11-29 02:18:56,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 02:18:56,037 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:18:56,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:18:56,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 02:18:56,037 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:18:56,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:18:56,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1684616547, now seen corresponding path program 1 times [2023-11-29 02:18:56,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:18:56,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860655935] [2023-11-29 02:18:56,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:18:56,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:18:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:56,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:18:56,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:18:56,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860655935] [2023-11-29 02:18:56,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860655935] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:18:56,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:18:56,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:18:56,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009540744] [2023-11-29 02:18:56,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:18:56,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:18:56,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:18:56,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:18:56,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:18:56,333 INFO L87 Difference]: Start difference. First operand 193 states and 245 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:18:56,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:18:56,806 INFO L93 Difference]: Finished difference Result 195 states and 238 transitions. [2023-11-29 02:18:56,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 02:18:56,809 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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 11 [2023-11-29 02:18:56,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:18:56,810 INFO L225 Difference]: With dead ends: 195 [2023-11-29 02:18:56,810 INFO L226 Difference]: Without dead ends: 195 [2023-11-29 02:18:56,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-11-29 02:18:56,811 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 241 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:18:56,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 223 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:18:56,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-11-29 02:18:56,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 181. [2023-11-29 02:18:56,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 133 states have (on average 1.6766917293233083) internal successors, (223), 179 states have internal predecessors, (223), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:18:56,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 229 transitions. [2023-11-29 02:18:56,817 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 229 transitions. Word has length 11 [2023-11-29 02:18:56,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:18:56,818 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 229 transitions. [2023-11-29 02:18:56,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:18:56,818 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 229 transitions. [2023-11-29 02:18:56,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 02:18:56,819 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:18:56,819 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:18:56,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 02:18:56,819 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:18:56,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:18:56,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1214320935, now seen corresponding path program 1 times [2023-11-29 02:18:56,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:18:56,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081423270] [2023-11-29 02:18:56,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:18:56,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:18:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:56,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 02:18:56,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:18:56,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081423270] [2023-11-29 02:18:56,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081423270] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:18:56,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:18:56,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:18:56,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297984003] [2023-11-29 02:18:56,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:18:56,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:18:56,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:18:56,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:18:56,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:18:56,890 INFO L87 Difference]: Start difference. First operand 181 states and 229 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:18:57,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:18:57,031 INFO L93 Difference]: Finished difference Result 209 states and 240 transitions. [2023-11-29 02:18:57,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:18:57,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-29 02:18:57,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:18:57,033 INFO L225 Difference]: With dead ends: 209 [2023-11-29 02:18:57,033 INFO L226 Difference]: Without dead ends: 209 [2023-11-29 02:18:57,033 INFO L412 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 [2023-11-29 02:18:57,034 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 244 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:18:57,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 172 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:18:57,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-11-29 02:18:57,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 180. [2023-11-29 02:18:57,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 133 states have (on average 1.6541353383458646) internal successors, (220), 178 states have internal predecessors, (220), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:18:57,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 225 transitions. [2023-11-29 02:18:57,041 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 225 transitions. Word has length 21 [2023-11-29 02:18:57,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:18:57,042 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 225 transitions. [2023-11-29 02:18:57,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:18:57,042 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 225 transitions. [2023-11-29 02:18:57,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 02:18:57,043 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:18:57,043 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:18:57,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 02:18:57,043 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:18:57,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:18:57,044 INFO L85 PathProgramCache]: Analyzing trace with hash 623717161, now seen corresponding path program 1 times [2023-11-29 02:18:57,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:18:57,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793302960] [2023-11-29 02:18:57,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:18:57,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:18:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:57,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:18:57,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:18:57,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793302960] [2023-11-29 02:18:57,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793302960] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:18:57,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706653714] [2023-11-29 02:18:57,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:18:57,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:18:57,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:18:57,443 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:18:57,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 02:18:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:57,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-29 02:18:57,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:18:57,621 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 6 treesize of output 5 [2023-11-29 02:18:57,731 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 02:18:57,731 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 17 treesize of output 21 [2023-11-29 02:18:57,801 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 15 treesize of output 1 [2023-11-29 02:18:57,924 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:18:57,924 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-29 02:18:57,992 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 02:18:57,993 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 1 case distinctions, treesize of input 33 treesize of output 24 [2023-11-29 02:18:58,053 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:18:58,054 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-29 02:18:58,233 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 25 treesize of output 13 [2023-11-29 02:18:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:18:58,281 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:18:58,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:18:58,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 38 treesize of output 31 [2023-11-29 02:18:58,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:18:58,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 144 treesize of output 131 [2023-11-29 02:18:58,819 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 80 treesize of output 76 [2023-11-29 02:18:58,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:18:58,832 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 76 treesize of output 74 [2023-11-29 02:19:01,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:19:01,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706653714] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:19:01,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:19:01,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 30 [2023-11-29 02:19:01,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804907127] [2023-11-29 02:19:01,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:19:01,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-29 02:19:01,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:19:01,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 02:19:01,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=773, Unknown=16, NotChecked=0, Total=930 [2023-11-29 02:19:01,773 INFO L87 Difference]: Start difference. First operand 180 states and 225 transitions. Second operand has 31 states, 30 states have (on average 2.3) internal successors, (69), 31 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:19:03,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:19:03,732 INFO L93 Difference]: Finished difference Result 349 states and 415 transitions. [2023-11-29 02:19:03,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 02:19:03,732 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.3) internal successors, (69), 31 states have internal predecessors, (69), 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 24 [2023-11-29 02:19:03,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:19:03,735 INFO L225 Difference]: With dead ends: 349 [2023-11-29 02:19:03,735 INFO L226 Difference]: Without dead ends: 349 [2023-11-29 02:19:03,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=321, Invalid=1469, Unknown=16, NotChecked=0, Total=1806 [2023-11-29 02:19:03,737 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 1207 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 1638 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1207 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 1738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:19:03,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1207 Valid, 972 Invalid, 1738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1638 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-29 02:19:03,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2023-11-29 02:19:03,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 208. [2023-11-29 02:19:03,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 161 states have (on average 1.5962732919254659) internal successors, (257), 206 states have internal predecessors, (257), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:19:03,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 262 transitions. [2023-11-29 02:19:03,746 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 262 transitions. Word has length 24 [2023-11-29 02:19:03,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:19:03,746 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 262 transitions. [2023-11-29 02:19:03,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.3) internal successors, (69), 31 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:19:03,747 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 262 transitions. [2023-11-29 02:19:03,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 02:19:03,748 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:19:03,748 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:19:03,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 02:19:03,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 02:19:03,949 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:19:03,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:19:03,949 INFO L85 PathProgramCache]: Analyzing trace with hash 623717162, now seen corresponding path program 1 times [2023-11-29 02:19:03,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:19:03,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10499221] [2023-11-29 02:19:03,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:19:03,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:19:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:04,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:19:04,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:19:04,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10499221] [2023-11-29 02:19:04,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10499221] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:19:04,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460948886] [2023-11-29 02:19:04,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:19:04,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:19:04,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:19:04,610 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:19:04,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 02:19:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:04,715 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-29 02:19:04,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:19:04,723 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 6 treesize of output 5 [2023-11-29 02:19:04,808 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 02:19:04,809 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 [2023-11-29 02:19:04,814 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 [2023-11-29 02:19:04,845 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 15 treesize of output 1 [2023-11-29 02:19:04,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-29 02:19:04,942 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:19:04,943 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:19:04,951 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 24 treesize of output 11 [2023-11-29 02:19:05,004 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 02:19:05,004 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-29 02:19:05,019 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 02:19:05,020 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 1 case distinctions, treesize of input 33 treesize of output 24 [2023-11-29 02:19:05,076 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:19:05,076 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:19:05,082 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 24 treesize of output 11 [2023-11-29 02:19:05,218 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 25 treesize of output 13 [2023-11-29 02:19:05,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-29 02:19:05,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:19:05,224 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:19:05,637 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_438 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_122| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_122|) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_438) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_122|) 9)) (< |v_ULTIMATE.start_main_~x~0#1.offset_122| 0))) (forall ((v_ArrVal_438 (Array Int Int)) (v_ArrVal_437 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_122| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_122|) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_438) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_122|) 11) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_437) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_122|))) (< |v_ULTIMATE.start_main_~x~0#1.offset_122| 0))))) is different from false [2023-11-29 02:19:05,825 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_438 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_122| Int) (v_ArrVal_433 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_122|) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_434) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_433) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_438) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_122|) 9)) (< |v_ULTIMATE.start_main_~x~0#1.offset_122| 0))) (forall ((v_ArrVal_438 (Array Int Int)) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_122| Int) (v_ArrVal_433 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_122|) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_433))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_434) .cse1 v_ArrVal_438) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_122|) 11) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_437) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_122|))))) (< |v_ULTIMATE.start_main_~x~0#1.offset_122| 0))))) is different from false [2023-11-29 02:19:05,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:19:05,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 73 treesize of output 74 [2023-11-29 02:19:05,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:19:05,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 65 treesize of output 50 [2023-11-29 02:19:05,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:19:05,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 632 treesize of output 567 [2023-11-29 02:19:05,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:19:05,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1127 treesize of output 1070 [2023-11-29 02:19:05,985 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 547 treesize of output 523 [2023-11-29 02:19:06,005 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 523 treesize of output 499 [2023-11-29 02:19:06,025 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 499 treesize of output 491 [2023-11-29 02:19:06,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:19:06,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 491 treesize of output 447 [2023-11-29 02:19:06,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:19:06,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 38 treesize of output 39 [2023-11-29 02:19:06,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:19:06,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 30 treesize of output 31 [2023-11-29 02:19:06,555 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:19:06,557 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 28 treesize of output 20 [2023-11-29 02:19:06,561 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:19:06,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:19:06,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:19:06,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 02:19:06,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:19:06,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460948886] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:19:06,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:19:06,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 31 [2023-11-29 02:19:06,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629371247] [2023-11-29 02:19:06,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:19:06,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-29 02:19:06,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:19:06,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-29 02:19:06,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=809, Unknown=17, NotChecked=118, Total=1056 [2023-11-29 02:19:06,788 INFO L87 Difference]: Start difference. First operand 208 states and 262 transitions. Second operand has 33 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:19:08,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:19:08,974 INFO L93 Difference]: Finished difference Result 348 states and 414 transitions. [2023-11-29 02:19:08,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 02:19:08,975 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 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 24 [2023-11-29 02:19:08,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:19:08,977 INFO L225 Difference]: With dead ends: 348 [2023-11-29 02:19:08,977 INFO L226 Difference]: Without dead ends: 348 [2023-11-29 02:19:08,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=390, Invalid=1857, Unknown=17, NotChecked=186, Total=2450 [2023-11-29 02:19:08,978 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 1611 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 1882 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1611 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 2766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 764 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:19:08,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1611 Valid, 890 Invalid, 2766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1882 Invalid, 0 Unknown, 764 Unchecked, 1.4s Time] [2023-11-29 02:19:08,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2023-11-29 02:19:08,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 208. [2023-11-29 02:19:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 161 states have (on average 1.5900621118012421) internal successors, (256), 206 states have internal predecessors, (256), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:19:08,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 261 transitions. [2023-11-29 02:19:08,985 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 261 transitions. Word has length 24 [2023-11-29 02:19:08,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:19:08,986 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 261 transitions. [2023-11-29 02:19:08,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:19:08,986 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 261 transitions. [2023-11-29 02:19:08,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 02:19:08,987 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:19:08,987 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:19:08,993 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 02:19:09,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 02:19:09,190 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:19:09,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:19:09,190 INFO L85 PathProgramCache]: Analyzing trace with hash -2139314169, now seen corresponding path program 1 times [2023-11-29 02:19:09,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:19:09,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695262247] [2023-11-29 02:19:09,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:19:09,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:19:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:09,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 02:19:09,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:19:09,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695262247] [2023-11-29 02:19:09,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695262247] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:19:09,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:19:09,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:19:09,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482825371] [2023-11-29 02:19:09,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:19:09,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:19:09,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:19:09,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:19:09,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:19:09,231 INFO L87 Difference]: Start difference. First operand 208 states and 261 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:19:09,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:19:09,271 INFO L93 Difference]: Finished difference Result 211 states and 264 transitions. [2023-11-29 02:19:09,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:19:09,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 25 [2023-11-29 02:19:09,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:19:09,273 INFO L225 Difference]: With dead ends: 211 [2023-11-29 02:19:09,273 INFO L226 Difference]: Without dead ends: 211 [2023-11-29 02:19:09,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:19:09,274 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:19:09,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 229 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:19:09,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-11-29 02:19:09,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2023-11-29 02:19:09,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 164 states have (on average 1.579268292682927) internal successors, (259), 209 states have internal predecessors, (259), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:19:09,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 264 transitions. [2023-11-29 02:19:09,280 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 264 transitions. Word has length 25 [2023-11-29 02:19:09,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:19:09,280 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 264 transitions. [2023-11-29 02:19:09,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:19:09,281 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 264 transitions. [2023-11-29 02:19:09,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 02:19:09,281 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:19:09,282 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 02:19:09,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 02:19:09,282 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:19:09,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:19:09,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1137797463, now seen corresponding path program 1 times [2023-11-29 02:19:09,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:19:09,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588959412] [2023-11-29 02:19:09,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:19:09,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:19:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:09,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:19:09,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:19:09,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588959412] [2023-11-29 02:19:09,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588959412] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:19:09,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878609781] [2023-11-29 02:19:09,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:19:09,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:19:09,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:19:09,781 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:19:09,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 02:19:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:09,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-29 02:19:09,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:19:09,922 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 6 treesize of output 5 [2023-11-29 02:19:10,006 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 02:19:10,007 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 [2023-11-29 02:19:10,043 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 15 treesize of output 1 [2023-11-29 02:19:10,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2023-11-29 02:19:10,145 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:19:10,145 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-29 02:19:10,151 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 24 treesize of output 11 [2023-11-29 02:19:10,162 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 [2023-11-29 02:19:10,192 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 11 [2023-11-29 02:19:10,214 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 11 [2023-11-29 02:19:10,384 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 23 treesize of output 15 [2023-11-29 02:19:10,387 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 26 treesize of output 14 [2023-11-29 02:19:10,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:19:10,394 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:19:10,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:19:10,453 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 31 treesize of output 35 [2023-11-29 02:19:10,747 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_127| Int) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_127| 0) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_580) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_583) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_127|) 1)) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_127|))) is different from false [2023-11-29 02:19:10,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:19:10,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 38 treesize of output 39 [2023-11-29 02:19:10,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:19:10,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 30 treesize of output 31 [2023-11-29 02:19:10,841 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 54 treesize of output 46 [2023-11-29 02:19:10,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:19:10,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 100 treesize of output 99 [2023-11-29 02:19:10,858 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 60 treesize of output 52 [2023-11-29 02:19:10,864 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 76 treesize of output 70 [2023-11-29 02:19:10,873 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 48 treesize of output 46 [2023-11-29 02:19:11,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:19:11,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878609781] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:19:11,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:19:11,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 37 [2023-11-29 02:19:11,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648052408] [2023-11-29 02:19:11,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:19:11,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-29 02:19:11,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:19:11,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-29 02:19:11,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1184, Unknown=6, NotChecked=70, Total=1406 [2023-11-29 02:19:11,135 INFO L87 Difference]: Start difference. First operand 211 states and 264 transitions. Second operand has 38 states, 37 states have (on average 2.1621621621621623) internal successors, (80), 38 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:19:14,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:19:14,118 INFO L93 Difference]: Finished difference Result 462 states and 553 transitions. [2023-11-29 02:19:14,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-11-29 02:19:14,118 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.1621621621621623) internal successors, (80), 38 states have internal predecessors, (80), 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 27 [2023-11-29 02:19:14,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:19:14,121 INFO L225 Difference]: With dead ends: 462 [2023-11-29 02:19:14,121 INFO L226 Difference]: Without dead ends: 462 [2023-11-29 02:19:14,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2429 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1519, Invalid=7035, Unknown=6, NotChecked=182, Total=8742 [2023-11-29 02:19:14,124 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 1543 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 2147 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1543 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 2855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 2147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 500 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:19:14,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1543 Valid, 1276 Invalid, 2855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 2147 Invalid, 0 Unknown, 500 Unchecked, 1.3s Time] [2023-11-29 02:19:14,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2023-11-29 02:19:14,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 239. [2023-11-29 02:19:14,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 199 states have (on average 1.4874371859296482) internal successors, (296), 237 states have internal predecessors, (296), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:19:14,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 301 transitions. [2023-11-29 02:19:14,133 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 301 transitions. Word has length 27 [2023-11-29 02:19:14,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:19:14,133 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 301 transitions. [2023-11-29 02:19:14,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.1621621621621623) internal successors, (80), 38 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:19:14,134 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 301 transitions. [2023-11-29 02:19:14,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 02:19:14,135 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:19:14,135 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 02:19:14,141 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 02:19:14,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 02:19:14,341 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:19:14,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:19:14,342 INFO L85 PathProgramCache]: Analyzing trace with hash 658021416, now seen corresponding path program 1 times [2023-11-29 02:19:14,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:19:14,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219823087] [2023-11-29 02:19:14,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:19:14,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:19:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:14,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 02:19:14,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:19:14,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219823087] [2023-11-29 02:19:14,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219823087] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:19:14,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:19:14,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:19:14,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203925749] [2023-11-29 02:19:14,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:19:14,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:19:14,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:19:14,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:19:14,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:19:14,473 INFO L87 Difference]: Start difference. First operand 239 states and 301 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:19:14,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:19:14,605 INFO L93 Difference]: Finished difference Result 253 states and 314 transitions. [2023-11-29 02:19:14,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:19:14,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 28 [2023-11-29 02:19:14,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:19:14,607 INFO L225 Difference]: With dead ends: 253 [2023-11-29 02:19:14,607 INFO L226 Difference]: Without dead ends: 253 [2023-11-29 02:19:14,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:19:14,608 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 31 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:19:14,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 263 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:19:14,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-11-29 02:19:14,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 239. [2023-11-29 02:19:14,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 199 states have (on average 1.4723618090452262) internal successors, (293), 237 states have internal predecessors, (293), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:19:14,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 298 transitions. [2023-11-29 02:19:14,616 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 298 transitions. Word has length 28 [2023-11-29 02:19:14,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:19:14,616 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 298 transitions. [2023-11-29 02:19:14,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:19:14,616 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 298 transitions. [2023-11-29 02:19:14,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 02:19:14,617 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:19:14,617 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 02:19:14,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 02:19:14,617 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:19:14,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:19:14,618 INFO L85 PathProgramCache]: Analyzing trace with hash 658080998, now seen corresponding path program 1 times [2023-11-29 02:19:14,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:19:14,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480367336] [2023-11-29 02:19:14,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:19:14,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:19:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:14,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 02:19:14,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:19:14,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480367336] [2023-11-29 02:19:14,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480367336] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:19:14,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:19:14,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:19:14,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39245401] [2023-11-29 02:19:14,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:19:14,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:19:14,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:19:14,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:19:14,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:19:14,675 INFO L87 Difference]: Start difference. First operand 239 states and 298 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:19:14,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:19:14,751 INFO L93 Difference]: Finished difference Result 236 states and 291 transitions. [2023-11-29 02:19:14,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:19:14,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 28 [2023-11-29 02:19:14,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:19:14,753 INFO L225 Difference]: With dead ends: 236 [2023-11-29 02:19:14,753 INFO L226 Difference]: Without dead ends: 236 [2023-11-29 02:19:14,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:19:14,754 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 62 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:19:14,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 123 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:19:14,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-11-29 02:19:14,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 235. [2023-11-29 02:19:14,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 199 states have (on average 1.4371859296482412) internal successors, (286), 233 states have internal predecessors, (286), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:19:14,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 291 transitions. [2023-11-29 02:19:14,761 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 291 transitions. Word has length 28 [2023-11-29 02:19:14,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:19:14,761 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 291 transitions. [2023-11-29 02:19:14,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:19:14,762 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 291 transitions. [2023-11-29 02:19:14,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 02:19:14,763 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:19:14,763 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 02:19:14,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 02:19:14,763 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:19:14,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:19:14,764 INFO L85 PathProgramCache]: Analyzing trace with hash 658080999, now seen corresponding path program 1 times [2023-11-29 02:19:14,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:19:14,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978820017] [2023-11-29 02:19:14,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:19:14,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:19:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:14,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 02:19:14,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:19:14,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978820017] [2023-11-29 02:19:14,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978820017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:19:14,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:19:14,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:19:14,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616864180] [2023-11-29 02:19:14,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:19:14,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:19:14,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:19:14,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:19:14,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:19:14,853 INFO L87 Difference]: Start difference. First operand 235 states and 291 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:19:14,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:19:14,930 INFO L93 Difference]: Finished difference Result 231 states and 284 transitions. [2023-11-29 02:19:14,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:19:14,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 28 [2023-11-29 02:19:14,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:19:14,932 INFO L225 Difference]: With dead ends: 231 [2023-11-29 02:19:14,932 INFO L226 Difference]: Without dead ends: 231 [2023-11-29 02:19:14,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:19:14,933 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 66 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:19:14,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 109 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:19:14,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2023-11-29 02:19:14,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2023-11-29 02:19:14,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 199 states have (on average 1.4020100502512562) internal successors, (279), 229 states have internal predecessors, (279), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:19:14,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 284 transitions. [2023-11-29 02:19:14,939 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 284 transitions. Word has length 28 [2023-11-29 02:19:14,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:19:14,939 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 284 transitions. [2023-11-29 02:19:14,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:19:14,940 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 284 transitions. [2023-11-29 02:19:14,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 02:19:14,941 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:19:14,941 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:19:14,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 02:19:14,941 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:19:14,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:19:14,942 INFO L85 PathProgramCache]: Analyzing trace with hash 250911958, now seen corresponding path program 1 times [2023-11-29 02:19:14,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:19:14,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542938676] [2023-11-29 02:19:14,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:19:14,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:19:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:15,553 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:19:15,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:19:15,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542938676] [2023-11-29 02:19:15,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542938676] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:19:15,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871103989] [2023-11-29 02:19:15,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:19:15,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:19:15,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:19:15,555 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:19:15,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 02:19:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:15,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-29 02:19:15,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:19:15,722 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 6 treesize of output 5 [2023-11-29 02:19:15,804 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 02:19:15,805 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 [2023-11-29 02:19:15,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2023-11-29 02:19:15,852 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 15 treesize of output 1 [2023-11-29 02:19:15,942 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:19:15,942 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-29 02:19:15,948 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 24 treesize of output 11 [2023-11-29 02:19:16,012 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-29 02:19:16,013 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 1 case distinctions, treesize of input 27 treesize of output 22 [2023-11-29 02:19:16,022 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 26 treesize of output 21 [2023-11-29 02:19:16,123 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 02:19:16,123 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 58 [2023-11-29 02:19:16,128 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 0 case distinctions, treesize of input 46 treesize of output 25 [2023-11-29 02:19:16,452 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:19:16,452 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:19:16,714 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (forall ((v_ArrVal_827 (Array Int Int))) (or (forall ((v_ArrVal_829 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_132| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_132|) (= (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 .cse2 v_ArrVal_829)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_132|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_827) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_132|)) 0) (< |v_ULTIMATE.start_main_~x~0#1.offset_132| 0))) (not (= v_ArrVal_827 (store .cse3 .cse2 (select v_ArrVal_827 .cse2)))))) (forall ((v_ArrVal_827 (Array Int Int))) (or (forall ((v_ArrVal_829 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_132| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_132|) (= (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_827))) (select (select .cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 .cse2 v_ArrVal_829)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_132|)) (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_132|))) 0) (< |v_ULTIMATE.start_main_~x~0#1.offset_132| 0))) (not (= v_ArrVal_827 (store .cse3 .cse2 (select v_ArrVal_827 .cse2)))))))) is different from false [2023-11-29 02:19:17,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:19:17,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 276 treesize of output 212 [2023-11-29 02:19:17,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:19:17,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 194 treesize of output 146 [2023-11-29 02:19:17,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:19:17,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1902 treesize of output 1810 [2023-11-29 02:19:17,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:19:18,850 INFO L349 Elim1Store]: treesize reduction 228, result has 59.4 percent of original size [2023-11-29 02:19:18,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 35011 treesize of output 29925 [2023-11-29 02:19:19,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:19:19,073 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 3364 treesize of output 3126 [2023-11-29 02:19:19,313 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:19:20,399 INFO L349 Elim1Store]: treesize reduction 399, result has 46.1 percent of original size [2023-11-29 02:19:20,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 24 case distinctions, treesize of input 2343 treesize of output 2437 [2023-11-29 02:19:30,230 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 7 treesize of output 3 [2023-11-29 02:19:49,879 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:19:49,907 INFO L224 Elim1Store]: Index analysis took 141 ms [2023-11-29 02:19:49,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:19:50,609 INFO L349 Elim1Store]: treesize reduction 913, result has 9.8 percent of original size [2023-11-29 02:19:50,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 29 case distinctions, treesize of input 152 treesize of output 194 [2023-11-29 02:19:51,869 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:19:51,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:19:52,586 INFO L349 Elim1Store]: treesize reduction 913, result has 9.8 percent of original size [2023-11-29 02:19:52,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 29 case distinctions, treesize of input 152 treesize of output 194 [2023-11-29 02:29:18,120 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2023-11-29 02:29:18,120 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-29 02:29:18,121 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-29 02:29:18,126 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 02:29:18,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 02:29:18,322 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_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 68 more [2023-11-29 02:29:18,325 INFO L158 Benchmark]: Toolchain (without parser) took 626708.90ms. Allocated memory was 153.1MB in the beginning and 394.3MB in the end (delta: 241.2MB). Free memory was 112.0MB in the beginning and 239.6MB in the end (delta: -127.5MB). Peak memory consumption was 243.1MB. Max. memory is 16.1GB. [2023-11-29 02:29:18,326 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 153.1MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:29:18,326 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.72ms. Allocated memory is still 153.1MB. Free memory was 111.5MB in the beginning and 93.7MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 02:29:18,326 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.17ms. Allocated memory is still 153.1MB. Free memory was 93.2MB in the beginning and 91.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 02:29:18,326 INFO L158 Benchmark]: Boogie Preprocessor took 57.81ms. Allocated memory is still 153.1MB. Free memory was 91.1MB in the beginning and 88.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 02:29:18,327 INFO L158 Benchmark]: RCFGBuilder took 713.30ms. Allocated memory was 153.1MB in the beginning and 188.7MB in the end (delta: 35.7MB). Free memory was 88.0MB in the beginning and 155.8MB in the end (delta: -67.9MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. [2023-11-29 02:29:18,327 INFO L158 Benchmark]: TraceAbstraction took 625451.91ms. Allocated memory was 188.7MB in the beginning and 394.3MB in the end (delta: 205.5MB). Free memory was 154.8MB in the beginning and 239.6MB in the end (delta: -84.8MB). Peak memory consumption was 249.7MB. Max. memory is 16.1GB. [2023-11-29 02:29:18,328 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.21ms. Allocated memory is still 153.1MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 434.72ms. Allocated memory is still 153.1MB. Free memory was 111.5MB in the beginning and 93.7MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.17ms. Allocated memory is still 153.1MB. Free memory was 93.2MB in the beginning and 91.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.81ms. Allocated memory is still 153.1MB. Free memory was 91.1MB in the beginning and 88.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 713.30ms. Allocated memory was 153.1MB in the beginning and 188.7MB in the end (delta: 35.7MB). Free memory was 88.0MB in the beginning and 155.8MB in the end (delta: -67.9MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. * TraceAbstraction took 625451.91ms. Allocated memory was 188.7MB in the beginning and 394.3MB in the end (delta: 205.5MB). Free memory was 154.8MB in the beginning and 239.6MB in the end (delta: -84.8MB). Peak memory consumption was 249.7MB. 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_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) 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/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-sorted-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:29:20,144 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:29:20,214 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 02:29:20,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:29:20,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:29:20,255 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:29:20,256 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:29:20,257 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:29:20,258 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:29:20,258 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:29:20,259 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:29:20,259 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:29:20,260 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:29:20,261 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:29:20,262 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:29:20,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:29:20,263 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:29:20,264 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:29:20,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:29:20,265 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:29:20,265 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 02:29:20,266 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 02:29:20,267 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 02:29:20,267 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:29:20,268 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:29:20,268 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 02:29:20,269 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 02:29:20,269 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:29:20,270 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:29:20,270 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:29:20,271 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:29:20,271 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:29:20,271 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:29:20,272 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:29:20,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:29:20,272 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:29:20,273 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:29:20,273 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 02:29:20,273 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 02:29:20,273 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:29:20,274 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:29:20,274 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:29:20,274 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:29:20,275 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 02:29:20,275 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 [2023-11-29 02:29:20,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:29:20,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:29:20,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:29:20,602 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:29:20,603 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:29:20,604 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/forester-heap/dll-sorted-2.i [2023-11-29 02:29:23,437 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:29:23,665 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:29:23,666 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/sv-benchmarks/c/forester-heap/dll-sorted-2.i [2023-11-29 02:29:23,680 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/data/3847c2b2e/78b4cb7859714cbda2c30368699de366/FLAG034d2df25 [2023-11-29 02:29:23,695 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/data/3847c2b2e/78b4cb7859714cbda2c30368699de366 [2023-11-29 02:29:23,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:29:23,699 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:29:23,700 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:29:23,700 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:29:23,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:29:23,705 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:29:23" (1/1) ... [2023-11-29 02:29:23,706 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66f6fa0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:23, skipping insertion in model container [2023-11-29 02:29:23,706 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:29:23" (1/1) ... [2023-11-29 02:29:23,756 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:29:24,049 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:29:24,077 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:29:24,126 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:29:24,158 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:29:24,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:24 WrapperNode [2023-11-29 02:29:24,159 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:29:24,160 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:29:24,160 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:29:24,160 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:29:24,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:24" (1/1) ... [2023-11-29 02:29:24,184 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:24" (1/1) ... [2023-11-29 02:29:24,213 INFO L138 Inliner]: procedures = 122, calls = 51, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 197 [2023-11-29 02:29:24,213 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:29:24,214 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:29:24,214 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:29:24,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:29:24,224 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:24" (1/1) ... [2023-11-29 02:29:24,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:24" (1/1) ... [2023-11-29 02:29:24,229 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:24" (1/1) ... [2023-11-29 02:29:24,246 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 15 writes are split as follows [0, 15]. [2023-11-29 02:29:24,247 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:24" (1/1) ... [2023-11-29 02:29:24,247 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:24" (1/1) ... [2023-11-29 02:29:24,261 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:24" (1/1) ... [2023-11-29 02:29:24,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:24" (1/1) ... [2023-11-29 02:29:24,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:24" (1/1) ... [2023-11-29 02:29:24,272 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:24" (1/1) ... [2023-11-29 02:29:24,277 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:29:24,278 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:29:24,278 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:29:24,279 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:29:24,280 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:24" (1/1) ... [2023-11-29 02:29:24,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:29:24,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:29:24,318 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:29:24,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:29:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-29 02:29:24,360 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-29 02:29:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 02:29:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 02:29:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 02:29:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:29:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 02:29:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 02:29:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 02:29:24,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 02:29:24,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 02:29:24,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 02:29:24,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 02:29:24,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 02:29:24,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 02:29:24,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:29:24,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:29:24,490 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:29:24,493 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:29:25,271 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:29:25,363 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:29:25,363 INFO L309 CfgBuilder]: Removed 18 assume(true) statements. [2023-11-29 02:29:25,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:29:25 BoogieIcfgContainer [2023-11-29 02:29:25,364 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:29:25,367 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:29:25,367 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:29:25,370 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:29:25,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:29:23" (1/3) ... [2023-11-29 02:29:25,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@479ed3de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:29:25, skipping insertion in model container [2023-11-29 02:29:25,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:24" (2/3) ... [2023-11-29 02:29:25,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@479ed3de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:29:25, skipping insertion in model container [2023-11-29 02:29:25,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:29:25" (3/3) ... [2023-11-29 02:29:25,373 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-sorted-2.i [2023-11-29 02:29:25,392 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:29:25,393 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 75 error locations. [2023-11-29 02:29:25,471 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:29:25,478 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@6dc4b339, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:29:25,478 INFO L358 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2023-11-29 02:29:25,483 INFO L276 IsEmpty]: Start isEmpty. Operand has 164 states, 81 states have (on average 2.382716049382716) internal successors, (193), 156 states have internal predecessors, (193), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 02:29:25,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 02:29:25,489 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:25,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 02:29:25,490 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:29:25,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:25,495 INFO L85 PathProgramCache]: Analyzing trace with hash 13219, now seen corresponding path program 1 times [2023-11-29 02:29:25,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:29:25,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906533822] [2023-11-29 02:29:25,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:25,505 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 [2023-11-29 02:29:25,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:29:25,507 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 02:29:25,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:29:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:25,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:29:25,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:29:25,674 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 6 treesize of output 7 [2023-11-29 02:29:25,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:25,687 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:29:25,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:29:25,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906533822] [2023-11-29 02:29:25,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906533822] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:25,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:25,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:29:25,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072414188] [2023-11-29 02:29:25,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:25,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:29:25,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:29:25,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:29:25,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:25,728 INFO L87 Difference]: Start difference. First operand has 164 states, 81 states have (on average 2.382716049382716) internal successors, (193), 156 states have internal predecessors, (193), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:26,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:26,113 INFO L93 Difference]: Finished difference Result 157 states and 174 transitions. [2023-11-29 02:29:26,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:29:26,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-29 02:29:26,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:26,125 INFO L225 Difference]: With dead ends: 157 [2023-11-29 02:29:26,125 INFO L226 Difference]: Without dead ends: 156 [2023-11-29 02:29:26,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:26,130 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 147 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:26,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 99 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:29:26,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-11-29 02:29:26,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2023-11-29 02:29:26,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 74 states have (on average 2.189189189189189) internal successors, (162), 150 states have internal predecessors, (162), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:26,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 168 transitions. [2023-11-29 02:29:26,178 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 168 transitions. Word has length 2 [2023-11-29 02:29:26,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:26,178 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 168 transitions. [2023-11-29 02:29:26,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:26,179 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 168 transitions. [2023-11-29 02:29:26,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 02:29:26,179 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:26,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 02:29:26,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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)] Forceful destruction successful, exit code 0 [2023-11-29 02:29:26,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:29:26,381 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:29:26,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:26,386 INFO L85 PathProgramCache]: Analyzing trace with hash 13220, now seen corresponding path program 1 times [2023-11-29 02:29:26,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:29:26,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530719532] [2023-11-29 02:29:26,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:26,387 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 [2023-11-29 02:29:26,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:29:26,388 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 02:29:26,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:29:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:26,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:29:26,430 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:29:26,442 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 6 treesize of output 5 [2023-11-29 02:29:26,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:26,454 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:29:26,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:29:26,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530719532] [2023-11-29 02:29:26,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1530719532] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:26,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:26,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:29:26,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923596189] [2023-11-29 02:29:26,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:26,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:29:26,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:29:26,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:29:26,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:26,458 INFO L87 Difference]: Start difference. First operand 152 states and 168 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:26,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:26,928 INFO L93 Difference]: Finished difference Result 153 states and 169 transitions. [2023-11-29 02:29:26,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:29:26,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-29 02:29:26,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:26,931 INFO L225 Difference]: With dead ends: 153 [2023-11-29 02:29:26,931 INFO L226 Difference]: Without dead ends: 153 [2023-11-29 02:29:26,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:26,933 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 144 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:26,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 99 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 02:29:26,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-11-29 02:29:26,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2023-11-29 02:29:26,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 74 states have (on average 2.1486486486486487) internal successors, (159), 147 states have internal predecessors, (159), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:26,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 165 transitions. [2023-11-29 02:29:26,947 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 165 transitions. Word has length 2 [2023-11-29 02:29:26,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:26,947 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 165 transitions. [2023-11-29 02:29:26,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:26,948 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 165 transitions. [2023-11-29 02:29:26,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 02:29:26,948 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:26,948 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:26,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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)] Forceful destruction successful, exit code 0 [2023-11-29 02:29:27,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:29:27,149 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:29:27,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:27,150 INFO L85 PathProgramCache]: Analyzing trace with hash 488403782, now seen corresponding path program 1 times [2023-11-29 02:29:27,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:29:27,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582234564] [2023-11-29 02:29:27,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:27,151 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 [2023-11-29 02:29:27,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:29:27,152 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 02:29:27,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:29:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:27,230 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 02:29:27,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:29:27,237 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 6 treesize of output 7 [2023-11-29 02:29:27,287 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 02:29:27,288 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 14 treesize of output 20 [2023-11-29 02:29:27,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:27,307 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:29:27,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:29:27,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582234564] [2023-11-29 02:29:27,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582234564] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:27,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:27,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:29:27,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415654756] [2023-11-29 02:29:27,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:27,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:29:27,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:29:27,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:29:27,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:29:27,311 INFO L87 Difference]: Start difference. First operand 149 states and 165 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:27,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:27,843 INFO L93 Difference]: Finished difference Result 155 states and 174 transitions. [2023-11-29 02:29:27,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:29:27,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 02:29:27,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:27,845 INFO L225 Difference]: With dead ends: 155 [2023-11-29 02:29:27,845 INFO L226 Difference]: Without dead ends: 155 [2023-11-29 02:29:27,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:29:27,847 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 252 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:27,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 75 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 02:29:27,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-11-29 02:29:27,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2023-11-29 02:29:27,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 87 states have (on average 1.896551724137931) internal successors, (165), 142 states have internal predecessors, (165), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:27,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 171 transitions. [2023-11-29 02:29:27,859 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 171 transitions. Word has length 7 [2023-11-29 02:29:27,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:27,860 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 171 transitions. [2023-11-29 02:29:27,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:27,860 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 171 transitions. [2023-11-29 02:29:27,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 02:29:27,861 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:27,861 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:27,863 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:29:28,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:29:28,064 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:29:28,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:28,064 INFO L85 PathProgramCache]: Analyzing trace with hash 488403783, now seen corresponding path program 1 times [2023-11-29 02:29:28,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:29:28,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397185236] [2023-11-29 02:29:28,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:28,065 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 [2023-11-29 02:29:28,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:29:28,087 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 02:29:28,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:29:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:28,165 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 02:29:28,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:29:28,177 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 6 treesize of output 5 [2023-11-29 02:29:28,252 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 02:29:28,252 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 12 treesize of output 14 [2023-11-29 02:29:28,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:28,270 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:29:28,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:29:28,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397185236] [2023-11-29 02:29:28,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [397185236] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:28,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:28,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:29:28,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802904007] [2023-11-29 02:29:28,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:28,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:29:28,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:29:28,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:29:28,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:29:28,273 INFO L87 Difference]: Start difference. First operand 144 states and 171 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:29,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:29,066 INFO L93 Difference]: Finished difference Result 216 states and 249 transitions. [2023-11-29 02:29:29,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:29:29,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 02:29:29,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:29,069 INFO L225 Difference]: With dead ends: 216 [2023-11-29 02:29:29,069 INFO L226 Difference]: Without dead ends: 216 [2023-11-29 02:29:29,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:29:29,071 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 281 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:29,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 118 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 02:29:29,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-11-29 02:29:29,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 187. [2023-11-29 02:29:29,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 130 states have (on average 1.7692307692307692) internal successors, (230), 185 states have internal predecessors, (230), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:29,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 236 transitions. [2023-11-29 02:29:29,084 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 236 transitions. Word has length 7 [2023-11-29 02:29:29,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:29,084 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 236 transitions. [2023-11-29 02:29:29,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:29,085 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 236 transitions. [2023-11-29 02:29:29,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 02:29:29,085 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:29,086 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:29,088 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:29:29,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:29:29,287 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:29:29,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:29,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1204949237, now seen corresponding path program 1 times [2023-11-29 02:29:29,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:29:29,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1901514699] [2023-11-29 02:29:29,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:29,289 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 [2023-11-29 02:29:29,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:29:29,290 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 02:29:29,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:29:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:29,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 02:29:29,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:29:29,378 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 6 treesize of output 7 [2023-11-29 02:29:29,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2023-11-29 02:29:29,417 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 19 treesize of output 11 [2023-11-29 02:29:29,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:29,429 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:29:29,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:29:29,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1901514699] [2023-11-29 02:29:29,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1901514699] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:29,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:29,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:29:29,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606198317] [2023-11-29 02:29:29,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:29,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:29:29,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:29:29,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:29:29,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:29:29,432 INFO L87 Difference]: Start difference. First operand 187 states and 236 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:30,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:30,049 INFO L93 Difference]: Finished difference Result 186 states and 234 transitions. [2023-11-29 02:29:30,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:29:30,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-29 02:29:30,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:30,053 INFO L225 Difference]: With dead ends: 186 [2023-11-29 02:29:30,054 INFO L226 Difference]: Without dead ends: 186 [2023-11-29 02:29:30,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:29:30,055 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 6 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:30,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 356 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 02:29:30,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-11-29 02:29:30,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2023-11-29 02:29:30,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 130 states have (on average 1.7538461538461538) internal successors, (228), 184 states have internal predecessors, (228), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:30,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 234 transitions. [2023-11-29 02:29:30,066 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 234 transitions. Word has length 9 [2023-11-29 02:29:30,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:30,066 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 234 transitions. [2023-11-29 02:29:30,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:30,067 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 234 transitions. [2023-11-29 02:29:30,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 02:29:30,067 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:30,067 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:30,069 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:29:30,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:29:30,268 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:29:30,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:30,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1204949238, now seen corresponding path program 1 times [2023-11-29 02:29:30,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:29:30,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [344953773] [2023-11-29 02:29:30,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:30,269 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 [2023-11-29 02:29:30,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:29:30,270 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 02:29:30,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 (7)] Waiting until timeout for monitored process [2023-11-29 02:29:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:30,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 02:29:30,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:29:30,345 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 6 treesize of output 5 [2023-11-29 02:29:30,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-29 02:29:30,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2023-11-29 02:29:30,400 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 17 treesize of output 9 [2023-11-29 02:29:30,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:30,418 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:29:30,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:29:30,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [344953773] [2023-11-29 02:29:30,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [344953773] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:30,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:30,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:29:30,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143454251] [2023-11-29 02:29:30,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:30,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:29:30,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:29:30,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:29:30,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:29:30,421 INFO L87 Difference]: Start difference. First operand 186 states and 234 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:31,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:31,176 INFO L93 Difference]: Finished difference Result 185 states and 232 transitions. [2023-11-29 02:29:31,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:29:31,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-29 02:29:31,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:31,178 INFO L225 Difference]: With dead ends: 185 [2023-11-29 02:29:31,178 INFO L226 Difference]: Without dead ends: 185 [2023-11-29 02:29:31,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:29:31,179 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 3 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:31,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 334 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 02:29:31,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-11-29 02:29:31,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2023-11-29 02:29:31,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 130 states have (on average 1.7384615384615385) internal successors, (226), 183 states have internal predecessors, (226), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:31,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 232 transitions. [2023-11-29 02:29:31,187 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 232 transitions. Word has length 9 [2023-11-29 02:29:31,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:31,188 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 232 transitions. [2023-11-29 02:29:31,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:31,188 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 232 transitions. [2023-11-29 02:29:31,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 02:29:31,188 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:31,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:31,191 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 (7)] Ended with exit code 0 [2023-11-29 02:29:31,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:29:31,389 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:29:31,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:31,389 INFO L85 PathProgramCache]: Analyzing trace with hash -2039868593, now seen corresponding path program 1 times [2023-11-29 02:29:31,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:29:31,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449798827] [2023-11-29 02:29:31,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:31,390 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 [2023-11-29 02:29:31,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:29:31,391 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 02:29:31,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 (8)] Waiting until timeout for monitored process [2023-11-29 02:29:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:31,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 02:29:31,451 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:29:31,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:31,463 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:29:31,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:29:31,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1449798827] [2023-11-29 02:29:31,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1449798827] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:31,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:31,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:29:31,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596944788] [2023-11-29 02:29:31,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:31,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:29:31,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:29:31,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:29:31,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:31,465 INFO L87 Difference]: Start difference. First operand 185 states and 232 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:31,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:31,605 INFO L93 Difference]: Finished difference Result 222 states and 272 transitions. [2023-11-29 02:29:31,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:29:31,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-29 02:29:31,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:31,608 INFO L225 Difference]: With dead ends: 222 [2023-11-29 02:29:31,608 INFO L226 Difference]: Without dead ends: 222 [2023-11-29 02:29:31,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:31,609 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 101 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:31,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 180 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:29:31,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-11-29 02:29:31,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 194. [2023-11-29 02:29:31,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 192 states have internal predecessors, (240), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:31,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 246 transitions. [2023-11-29 02:29:31,617 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 246 transitions. Word has length 11 [2023-11-29 02:29:31,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:31,617 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 246 transitions. [2023-11-29 02:29:31,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:31,617 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 246 transitions. [2023-11-29 02:29:31,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 02:29:31,618 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:31,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:31,621 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 (8)] Forceful destruction successful, exit code 0 [2023-11-29 02:29:31,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:29:31,821 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:29:31,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:31,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1684616548, now seen corresponding path program 1 times [2023-11-29 02:29:31,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:29:31,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [225000554] [2023-11-29 02:29:31,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:31,822 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 [2023-11-29 02:29:31,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:29:31,823 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 02:29:31,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:29:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:31,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 02:29:31,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:29:31,925 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 6 treesize of output 7 [2023-11-29 02:29:31,974 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 02:29:31,975 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 19 treesize of output 27 [2023-11-29 02:29:32,021 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 15 treesize of output 1 [2023-11-29 02:29:32,127 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:29:32,127 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 02:29:32,149 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 27 treesize of output 15 [2023-11-29 02:29:32,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:32,190 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:29:32,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:29:32,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [225000554] [2023-11-29 02:29:32,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [225000554] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:32,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:32,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:29:32,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675069667] [2023-11-29 02:29:32,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:32,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:29:32,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:29:32,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:29:32,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:29:32,194 INFO L87 Difference]: Start difference. First operand 194 states and 246 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:33,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:33,262 INFO L93 Difference]: Finished difference Result 212 states and 257 transitions. [2023-11-29 02:29:33,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:29:33,263 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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 11 [2023-11-29 02:29:33,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:33,264 INFO L225 Difference]: With dead ends: 212 [2023-11-29 02:29:33,265 INFO L226 Difference]: Without dead ends: 212 [2023-11-29 02:29:33,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2023-11-29 02:29:33,266 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 310 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:33,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 206 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 02:29:33,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-11-29 02:29:33,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 193. [2023-11-29 02:29:33,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 139 states have (on average 1.7122302158273381) internal successors, (238), 191 states have internal predecessors, (238), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:33,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 244 transitions. [2023-11-29 02:29:33,273 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 244 transitions. Word has length 11 [2023-11-29 02:29:33,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:33,273 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 244 transitions. [2023-11-29 02:29:33,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:33,273 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 244 transitions. [2023-11-29 02:29:33,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 02:29:33,274 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:33,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:33,277 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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)] Forceful destruction successful, exit code 0 [2023-11-29 02:29:33,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:29:33,475 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:29:33,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:33,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1684616547, now seen corresponding path program 1 times [2023-11-29 02:29:33,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:29:33,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929971951] [2023-11-29 02:29:33,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:33,476 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 [2023-11-29 02:29:33,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:29:33,477 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 02:29:33,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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)] Waiting until timeout for monitored process [2023-11-29 02:29:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:33,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 02:29:33,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:29:33,606 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 6 treesize of output 7 [2023-11-29 02:29:33,649 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:29:33,649 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 [2023-11-29 02:29:33,658 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 6 treesize of output 5 [2023-11-29 02:29:33,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-29 02:29:33,720 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 15 treesize of output 1 [2023-11-29 02:29:33,831 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:29:33,831 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:29:33,844 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 24 treesize of output 11 [2023-11-29 02:29:33,864 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 25 treesize of output 13 [2023-11-29 02:29:33,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-29 02:29:33,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:33,894 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:29:33,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:29:33,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [929971951] [2023-11-29 02:29:33,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [929971951] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:33,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:33,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:29:33,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075815255] [2023-11-29 02:29:33,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:33,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:29:33,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:29:33,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:29:33,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:29:33,897 INFO L87 Difference]: Start difference. First operand 193 states and 244 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:35,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:35,141 INFO L93 Difference]: Finished difference Result 194 states and 237 transitions. [2023-11-29 02:29:35,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 02:29:35,142 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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 11 [2023-11-29 02:29:35,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:35,143 INFO L225 Difference]: With dead ends: 194 [2023-11-29 02:29:35,143 INFO L226 Difference]: Without dead ends: 194 [2023-11-29 02:29:35,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-11-29 02:29:35,144 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 239 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:35,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 223 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 02:29:35,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-11-29 02:29:35,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 181. [2023-11-29 02:29:35,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 133 states have (on average 1.669172932330827) internal successors, (222), 179 states have internal predecessors, (222), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:35,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 228 transitions. [2023-11-29 02:29:35,151 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 228 transitions. Word has length 11 [2023-11-29 02:29:35,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:35,151 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 228 transitions. [2023-11-29 02:29:35,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:35,152 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 228 transitions. [2023-11-29 02:29:35,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 02:29:35,153 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:35,153 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:35,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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)] Forceful destruction successful, exit code 0 [2023-11-29 02:29:35,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:29:35,354 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:29:35,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:35,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1214320935, now seen corresponding path program 1 times [2023-11-29 02:29:35,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:29:35,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2147406421] [2023-11-29 02:29:35,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:35,355 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 [2023-11-29 02:29:35,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:29:35,356 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 02:29:35,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:29:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:35,459 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:29:35,460 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:29:35,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 02:29:35,498 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:29:35,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:29:35,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2147406421] [2023-11-29 02:29:35,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2147406421] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:35,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:35,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:29:35,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982090510] [2023-11-29 02:29:35,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:35,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:29:35,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:29:35,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:29:35,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:29:35,499 INFO L87 Difference]: Start difference. First operand 181 states and 228 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:35,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:35,886 INFO L93 Difference]: Finished difference Result 208 states and 239 transitions. [2023-11-29 02:29:35,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:29:35,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-29 02:29:35,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:35,888 INFO L225 Difference]: With dead ends: 208 [2023-11-29 02:29:35,888 INFO L226 Difference]: Without dead ends: 208 [2023-11-29 02:29:35,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:29:35,889 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 243 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:35,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 172 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 02:29:35,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-11-29 02:29:35,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 180. [2023-11-29 02:29:35,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 133 states have (on average 1.6466165413533835) internal successors, (219), 178 states have internal predecessors, (219), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:35,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 224 transitions. [2023-11-29 02:29:35,894 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 224 transitions. Word has length 21 [2023-11-29 02:29:35,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:35,894 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 224 transitions. [2023-11-29 02:29:35,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:35,895 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 224 transitions. [2023-11-29 02:29:35,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 02:29:35,895 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:35,896 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:35,899 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 02:29:36,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:29:36,096 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:29:36,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:36,097 INFO L85 PathProgramCache]: Analyzing trace with hash 623717161, now seen corresponding path program 1 times [2023-11-29 02:29:36,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:29:36,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282556027] [2023-11-29 02:29:36,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:36,097 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 [2023-11-29 02:29:36,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:29:36,098 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 02:29:36,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 (12)] Waiting until timeout for monitored process [2023-11-29 02:29:36,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:36,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 02:29:36,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:29:36,264 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 6 treesize of output 7 [2023-11-29 02:29:36,333 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 02:29:36,334 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 19 treesize of output 27 [2023-11-29 02:29:36,398 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 15 treesize of output 1 [2023-11-29 02:29:36,521 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:29:36,522 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 02:29:36,599 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 02:29:36,599 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 1 case distinctions, treesize of input 35 treesize of output 26 [2023-11-29 02:29:36,660 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:29:36,660 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 02:29:36,806 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 27 treesize of output 15 [2023-11-29 02:29:36,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:36,846 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:29:36,934 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_313 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_313) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2023-11-29 02:29:36,962 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_313 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_313) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2023-11-29 02:29:36,977 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_311 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_313 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_311))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_313)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2023-11-29 02:29:36,992 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_311 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_313 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_311))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_313)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (_ bv0 1))) is different from false [2023-11-29 02:29:37,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:29:37,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 40 treesize of output 33 [2023-11-29 02:29:37,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:29:37,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 268 treesize of output 243 [2023-11-29 02:29:37,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:29:37,050 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 187 treesize of output 183 [2023-11-29 02:29:37,061 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 175 treesize of output 167 [2023-11-29 02:29:53,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:53,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:29:53,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282556027] [2023-11-29 02:29:53,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282556027] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:29:53,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:29:53,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 19 [2023-11-29 02:29:53,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043629972] [2023-11-29 02:29:53,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:29:53,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 02:29:53,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:29:53,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 02:29:53,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=206, Unknown=7, NotChecked=132, Total=420 [2023-11-29 02:29:53,734 INFO L87 Difference]: Start difference. First operand 180 states and 224 transitions. Second operand has 21 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:56,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:56,058 INFO L93 Difference]: Finished difference Result 302 states and 355 transitions. [2023-11-29 02:29:56,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 02:29:56,059 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 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 24 [2023-11-29 02:29:56,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:56,061 INFO L225 Difference]: With dead ends: 302 [2023-11-29 02:29:56,061 INFO L226 Difference]: Without dead ends: 302 [2023-11-29 02:29:56,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=124, Invalid=347, Unknown=7, NotChecked=172, Total=650 [2023-11-29 02:29:56,063 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 643 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 2094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1297 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:56,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 545 Invalid, 2094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 741 Invalid, 0 Unknown, 1297 Unchecked, 2.1s Time] [2023-11-29 02:29:56,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2023-11-29 02:29:56,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 208. [2023-11-29 02:29:56,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 161 states have (on average 1.5962732919254659) internal successors, (257), 206 states have internal predecessors, (257), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:56,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 262 transitions. [2023-11-29 02:29:56,068 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 262 transitions. Word has length 24 [2023-11-29 02:29:56,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:56,069 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 262 transitions. [2023-11-29 02:29:56,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:56,069 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 262 transitions. [2023-11-29 02:29:56,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 02:29:56,070 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:56,070 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:56,074 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 (12)] Ended with exit code 0 [2023-11-29 02:29:56,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:29:56,271 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:29:56,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:56,271 INFO L85 PathProgramCache]: Analyzing trace with hash 623717162, now seen corresponding path program 1 times [2023-11-29 02:29:56,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:29:56,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273268771] [2023-11-29 02:29:56,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:56,272 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 [2023-11-29 02:29:56,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:29:56,272 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 02:29:56,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 (13)] Waiting until timeout for monitored process [2023-11-29 02:29:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:56,430 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-29 02:29:56,433 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:29:56,435 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 6 treesize of output 7 [2023-11-29 02:29:56,478 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 6 treesize of output 5 [2023-11-29 02:29:56,492 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:29:56,492 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 [2023-11-29 02:29:56,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-29 02:29:56,531 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 15 treesize of output 1 [2023-11-29 02:29:56,625 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:29:56,626 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:29:56,637 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 24 treesize of output 11 [2023-11-29 02:29:56,694 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 02:29:56,695 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 1 case distinctions, treesize of input 33 treesize of output 24 [2023-11-29 02:29:56,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:29:56,708 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 11 [2023-11-29 02:29:56,756 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:29:56,757 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:29:56,767 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 24 treesize of output 11 [2023-11-29 02:29:56,902 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 25 treesize of output 13 [2023-11-29 02:29:56,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-29 02:29:56,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:56,928 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:29:57,194 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_370 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_370) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_369 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_370) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_369) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-11-29 02:29:57,251 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_370 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_370) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_369 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_370) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_369) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2023-11-29 02:29:57,477 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_369 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_365))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_366) .cse0 v_ArrVal_370) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_369) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_370 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_366) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_365) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_370) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))) is different from false [2023-11-29 02:29:57,634 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_369 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_365))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_366) .cse1 v_ArrVal_370) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_369) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_370 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_366) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_365) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_370) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd (_ bv12 32) .cse3)))))) is different from false [2023-11-29 02:29:57,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:29:57,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 73 treesize of output 66 [2023-11-29 02:29:57,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:29:57,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 57 treesize of output 50 [2023-11-29 02:29:57,677 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 84 treesize of output 72 [2023-11-29 02:29:57,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:29:57,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 140 treesize of output 131 [2023-11-29 02:29:57,724 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 82 treesize of output 74 [2023-11-29 02:29:57,729 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 108 treesize of output 96 [2023-11-29 02:29:57,746 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 66 treesize of output 62 [2023-11-29 02:29:57,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:29:57,898 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 1 case distinctions, treesize of input 73 treesize of output 74 [2023-11-29 02:29:57,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:29:57,914 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 1 case distinctions, treesize of input 65 treesize of output 50 [2023-11-29 02:29:57,918 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:29:57,919 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:29:57,923 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2023-11-29 02:29:57,928 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:29:57,933 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2023-11-29 02:29:58,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:58,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:29:58,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273268771] [2023-11-29 02:29:58,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1273268771] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:29:58,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:29:58,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2023-11-29 02:29:58,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255620838] [2023-11-29 02:29:58,137 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:29:58,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 02:29:58,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:29:58,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 02:29:58,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=197, Unknown=4, NotChecked=124, Total=380 [2023-11-29 02:29:58,138 INFO L87 Difference]: Start difference. First operand 208 states and 262 transitions. Second operand has 20 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:01,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:30:01,599 INFO L93 Difference]: Finished difference Result 297 states and 350 transitions. [2023-11-29 02:30:01,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 02:30:01,600 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 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 24 [2023-11-29 02:30:01,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:30:01,601 INFO L225 Difference]: With dead ends: 297 [2023-11-29 02:30:01,601 INFO L226 Difference]: Without dead ends: 297 [2023-11-29 02:30:01,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=145, Invalid=517, Unknown=4, NotChecked=204, Total=870 [2023-11-29 02:30:01,603 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 463 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 2189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1245 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:30:01,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 582 Invalid, 2189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 908 Invalid, 0 Unknown, 1245 Unchecked, 2.8s Time] [2023-11-29 02:30:01,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-11-29 02:30:01,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 208. [2023-11-29 02:30:01,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 161 states have (on average 1.5900621118012421) internal successors, (256), 206 states have internal predecessors, (256), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:01,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 261 transitions. [2023-11-29 02:30:01,609 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 261 transitions. Word has length 24 [2023-11-29 02:30:01,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:30:01,610 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 261 transitions. [2023-11-29 02:30:01,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:01,610 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 261 transitions. [2023-11-29 02:30:01,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 02:30:01,611 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:30:01,611 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:30:01,614 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 (13)] Ended with exit code 0 [2023-11-29 02:30:01,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:30:01,811 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:30:01,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:01,812 INFO L85 PathProgramCache]: Analyzing trace with hash -2139314169, now seen corresponding path program 1 times [2023-11-29 02:30:01,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:30:01,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758685728] [2023-11-29 02:30:01,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:01,812 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 [2023-11-29 02:30:01,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:30:01,813 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 02:30:01,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 (14)] Waiting until timeout for monitored process [2023-11-29 02:30:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:01,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 02:30:01,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:30:01,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 02:30:01,908 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:30:01,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:30:01,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [758685728] [2023-11-29 02:30:01,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [758685728] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:01,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:01,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:30:01,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44319931] [2023-11-29 02:30:01,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:01,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:30:01,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:30:01,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:30:01,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:30:01,910 INFO L87 Difference]: Start difference. First operand 208 states and 261 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:02,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:30:02,026 INFO L93 Difference]: Finished difference Result 211 states and 264 transitions. [2023-11-29 02:30:02,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:30:02,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 25 [2023-11-29 02:30:02,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:30:02,027 INFO L225 Difference]: With dead ends: 211 [2023-11-29 02:30:02,027 INFO L226 Difference]: Without dead ends: 211 [2023-11-29 02:30:02,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:30:02,028 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:30:02,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 229 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:30:02,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-11-29 02:30:02,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2023-11-29 02:30:02,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 164 states have (on average 1.579268292682927) internal successors, (259), 209 states have internal predecessors, (259), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:02,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 264 transitions. [2023-11-29 02:30:02,033 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 264 transitions. Word has length 25 [2023-11-29 02:30:02,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:30:02,034 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 264 transitions. [2023-11-29 02:30:02,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:02,034 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 264 transitions. [2023-11-29 02:30:02,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 02:30:02,035 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:30:02,035 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 02:30:02,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 (14)] Ended with exit code 0 [2023-11-29 02:30:02,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:30:02,235 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:30:02,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:02,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1137797463, now seen corresponding path program 1 times [2023-11-29 02:30:02,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:30:02,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205057262] [2023-11-29 02:30:02,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:02,236 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 [2023-11-29 02:30:02,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:30:02,237 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 02:30:02,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 (15)] Waiting until timeout for monitored process [2023-11-29 02:30:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:02,410 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-29 02:30:02,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:30:02,418 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 6 treesize of output 7 [2023-11-29 02:30:02,487 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:30:02,487 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 [2023-11-29 02:30:02,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-29 02:30:02,547 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 15 treesize of output 1 [2023-11-29 02:30:02,651 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:30:02,652 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-29 02:30:02,661 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 24 treesize of output 11 [2023-11-29 02:30:02,741 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 02:30:02,742 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-29 02:30:02,762 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 02:30:02,762 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 1 case distinctions, treesize of input 24 treesize of output 17 [2023-11-29 02:30:02,832 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:30:02,832 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2023-11-29 02:30:02,838 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 24 treesize of output 11 [2023-11-29 02:30:02,844 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 19 treesize of output 11 [2023-11-29 02:30:03,009 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 27 treesize of output 15 [2023-11-29 02:30:03,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-29 02:30:03,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:30:03,071 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:30:03,264 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 46 treesize of output 26 [2023-11-29 02:30:03,279 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_471) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_473 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_473) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|))) is different from false [2023-11-29 02:30:03,448 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_467))) (= (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_468) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_471) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_468))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse1 (select (select (store .cse2 .cse1 v_ArrVal_473) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2023-11-29 02:30:03,477 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_473 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_468))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_473) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_468 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_467))) (= (select (select (store .cse3 (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_468) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_471) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)))))) is different from false [2023-11-29 02:30:03,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:30:03,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 51 treesize of output 44 [2023-11-29 02:30:03,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:30:03,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 35 treesize of output 36 [2023-11-29 02:30:03,522 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 64 treesize of output 56 [2023-11-29 02:30:03,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:30:03,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 382 treesize of output 325 [2023-11-29 02:30:03,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:30:03,585 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 64 treesize of output 63 [2023-11-29 02:30:03,594 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 54 treesize of output 50 [2023-11-29 02:30:03,603 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 74 treesize of output 68 [2023-11-29 02:30:03,674 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 02:30:03,674 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 1 case distinctions, treesize of input 51 treesize of output 1 [2023-11-29 02:30:07,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:30:07,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:30:07,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205057262] [2023-11-29 02:30:07,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1205057262] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:30:07,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:30:07,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2023-11-29 02:30:07,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122347078] [2023-11-29 02:30:07,816 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:30:07,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-29 02:30:07,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:30:07,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-29 02:30:07,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=291, Unknown=10, NotChecked=108, Total=462 [2023-11-29 02:30:07,817 INFO L87 Difference]: Start difference. First operand 211 states and 264 transitions. Second operand has 22 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:10,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:30:10,965 INFO L93 Difference]: Finished difference Result 273 states and 316 transitions. [2023-11-29 02:30:10,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 02:30:10,966 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 21 states have internal predecessors, (51), 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 27 [2023-11-29 02:30:10,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:30:10,967 INFO L225 Difference]: With dead ends: 273 [2023-11-29 02:30:10,968 INFO L226 Difference]: Without dead ends: 273 [2023-11-29 02:30:10,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=183, Invalid=747, Unknown=12, NotChecked=180, Total=1122 [2023-11-29 02:30:10,969 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 449 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 2015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 843 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:30:10,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 864 Invalid, 2015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1144 Invalid, 0 Unknown, 843 Unchecked, 2.6s Time] [2023-11-29 02:30:10,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-11-29 02:30:10,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 208. [2023-11-29 02:30:10,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 161 states have (on average 1.5776397515527951) internal successors, (254), 206 states have internal predecessors, (254), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:10,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 259 transitions. [2023-11-29 02:30:10,975 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 259 transitions. Word has length 27 [2023-11-29 02:30:10,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:30:10,976 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 259 transitions. [2023-11-29 02:30:10,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:10,976 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 259 transitions. [2023-11-29 02:30:10,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 02:30:10,977 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:30:10,977 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 02:30:10,980 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 (15)] Ended with exit code 0 [2023-11-29 02:30:11,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:30:11,178 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:30:11,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:11,178 INFO L85 PathProgramCache]: Analyzing trace with hash 658021416, now seen corresponding path program 1 times [2023-11-29 02:30:11,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:30:11,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706583794] [2023-11-29 02:30:11,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:11,178 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 [2023-11-29 02:30:11,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:30:11,179 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 02:30:11,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 (16)] Waiting until timeout for monitored process [2023-11-29 02:30:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:11,290 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 02:30:11,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:30:11,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 02:30:11,358 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:30:11,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:30:11,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706583794] [2023-11-29 02:30:11,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1706583794] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:11,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:11,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:30:11,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133923316] [2023-11-29 02:30:11,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:11,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:30:11,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:30:11,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:30:11,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:30:11,360 INFO L87 Difference]: Start difference. First operand 208 states and 259 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:11,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:30:12,000 INFO L93 Difference]: Finished difference Result 228 states and 281 transitions. [2023-11-29 02:30:12,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:30:12,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 28 [2023-11-29 02:30:12,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:30:12,002 INFO L225 Difference]: With dead ends: 228 [2023-11-29 02:30:12,002 INFO L226 Difference]: Without dead ends: 228 [2023-11-29 02:30:12,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:30:12,003 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 21 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:30:12,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 335 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 02:30:12,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-11-29 02:30:12,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 214. [2023-11-29 02:30:12,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 167 states have (on average 1.562874251497006) internal successors, (261), 212 states have internal predecessors, (261), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:12,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 266 transitions. [2023-11-29 02:30:12,009 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 266 transitions. Word has length 28 [2023-11-29 02:30:12,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:30:12,009 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 266 transitions. [2023-11-29 02:30:12,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:12,009 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 266 transitions. [2023-11-29 02:30:12,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 02:30:12,010 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:30:12,010 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 02:30:12,014 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 (16)] Ended with exit code 0 [2023-11-29 02:30:12,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:30:12,211 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:30:12,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:12,211 INFO L85 PathProgramCache]: Analyzing trace with hash 658080998, now seen corresponding path program 1 times [2023-11-29 02:30:12,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:30:12,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024942984] [2023-11-29 02:30:12,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:12,212 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 [2023-11-29 02:30:12,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:30:12,213 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 02:30:12,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 (17)] Waiting until timeout for monitored process [2023-11-29 02:30:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:12,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:30:12,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:30:12,323 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 6 treesize of output 7 [2023-11-29 02:30:12,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 02:30:12,328 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:30:12,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:30:12,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024942984] [2023-11-29 02:30:12,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1024942984] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:12,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:12,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:30:12,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542233151] [2023-11-29 02:30:12,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:12,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:30:12,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:30:12,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:30:12,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:30:12,330 INFO L87 Difference]: Start difference. First operand 214 states and 266 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:12,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:30:12,618 INFO L93 Difference]: Finished difference Result 211 states and 258 transitions. [2023-11-29 02:30:12,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:30:12,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 28 [2023-11-29 02:30:12,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:30:12,619 INFO L225 Difference]: With dead ends: 211 [2023-11-29 02:30:12,619 INFO L226 Difference]: Without dead ends: 211 [2023-11-29 02:30:12,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:30:12,620 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 66 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:30:12,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 133 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:30:12,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-11-29 02:30:12,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 210. [2023-11-29 02:30:12,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 167 states have (on average 1.5149700598802396) internal successors, (253), 208 states have internal predecessors, (253), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:12,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 258 transitions. [2023-11-29 02:30:12,625 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 258 transitions. Word has length 28 [2023-11-29 02:30:12,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:30:12,625 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 258 transitions. [2023-11-29 02:30:12,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:12,625 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 258 transitions. [2023-11-29 02:30:12,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 02:30:12,626 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:30:12,626 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 02:30:12,628 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 (17)] Ended with exit code 0 [2023-11-29 02:30:12,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:30:12,826 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:30:12,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:12,827 INFO L85 PathProgramCache]: Analyzing trace with hash 658080999, now seen corresponding path program 1 times [2023-11-29 02:30:12,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:30:12,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065188602] [2023-11-29 02:30:12,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:12,827 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 [2023-11-29 02:30:12,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:30:12,828 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 02:30:12,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 (18)] Waiting until timeout for monitored process [2023-11-29 02:30:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:12,951 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:30:12,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:30:12,958 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 6 treesize of output 5 [2023-11-29 02:30:12,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 02:30:12,967 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:30:12,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:30:12,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065188602] [2023-11-29 02:30:12,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065188602] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:12,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:12,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:30:12,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424023914] [2023-11-29 02:30:12,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:12,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:30:12,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:30:12,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:30:12,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:30:12,969 INFO L87 Difference]: Start difference. First operand 210 states and 258 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:13,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:30:13,316 INFO L93 Difference]: Finished difference Result 206 states and 250 transitions. [2023-11-29 02:30:13,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:30:13,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 28 [2023-11-29 02:30:13,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:30:13,319 INFO L225 Difference]: With dead ends: 206 [2023-11-29 02:30:13,319 INFO L226 Difference]: Without dead ends: 206 [2023-11-29 02:30:13,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:30:13,320 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 70 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:30:13,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 112 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:30:13,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-11-29 02:30:13,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2023-11-29 02:30:13,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 167 states have (on average 1.467065868263473) internal successors, (245), 204 states have internal predecessors, (245), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:13,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 250 transitions. [2023-11-29 02:30:13,325 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 250 transitions. Word has length 28 [2023-11-29 02:30:13,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:30:13,326 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 250 transitions. [2023-11-29 02:30:13,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:13,326 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 250 transitions. [2023-11-29 02:30:13,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 02:30:13,327 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:30:13,327 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 02:30:13,330 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 (18)] Ended with exit code 0 [2023-11-29 02:30:13,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:30:13,528 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:30:13,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:13,528 INFO L85 PathProgramCache]: Analyzing trace with hash 189053735, now seen corresponding path program 1 times [2023-11-29 02:30:13,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:30:13,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259033799] [2023-11-29 02:30:13,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:13,529 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 [2023-11-29 02:30:13,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:30:13,530 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 02:30:13,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 (19)] Waiting until timeout for monitored process [2023-11-29 02:30:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:13,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 02:30:13,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:30:13,769 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 23 treesize of output 15 [2023-11-29 02:30:13,773 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 34 treesize of output 18 [2023-11-29 02:30:13,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 02:30:13,818 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:30:13,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:30:13,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259033799] [2023-11-29 02:30:13,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259033799] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:13,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:13,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:30:13,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168714853] [2023-11-29 02:30:13,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:13,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:30:13,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:30:13,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:30:13,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:30:13,819 INFO L87 Difference]: Start difference. First operand 206 states and 250 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:15,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:30:15,357 INFO L93 Difference]: Finished difference Result 223 states and 265 transitions. [2023-11-29 02:30:15,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:30:15,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 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 30 [2023-11-29 02:30:15,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:30:15,359 INFO L225 Difference]: With dead ends: 223 [2023-11-29 02:30:15,359 INFO L226 Difference]: Without dead ends: 223 [2023-11-29 02:30:15,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:30:15,360 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 56 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:30:15,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 267 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 02:30:15,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2023-11-29 02:30:15,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 209. [2023-11-29 02:30:15,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 172 states have (on average 1.4534883720930232) internal successors, (250), 207 states have internal predecessors, (250), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:15,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 255 transitions. [2023-11-29 02:30:15,365 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 255 transitions. Word has length 30 [2023-11-29 02:30:15,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:30:15,365 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 255 transitions. [2023-11-29 02:30:15,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:15,365 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 255 transitions. [2023-11-29 02:30:15,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 02:30:15,365 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:30:15,365 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 02:30:15,368 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 (19)] Ended with exit code 0 [2023-11-29 02:30:15,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:30:15,566 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:30:15,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:15,566 INFO L85 PathProgramCache]: Analyzing trace with hash 381974618, now seen corresponding path program 1 times [2023-11-29 02:30:15,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:30:15,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268187830] [2023-11-29 02:30:15,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:15,567 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 [2023-11-29 02:30:15,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:30:15,567 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 02:30:15,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 (20)] Waiting until timeout for monitored process [2023-11-29 02:30:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:15,737 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-29 02:30:15,739 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:30:15,745 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 6 treesize of output 7 [2023-11-29 02:30:15,821 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:30:15,821 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 [2023-11-29 02:30:15,859 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 15 treesize of output 1 [2023-11-29 02:30:15,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-29 02:30:15,973 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:30:15,974 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-29 02:30:15,982 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 24 treesize of output 11 [2023-11-29 02:30:16,066 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 02:30:16,067 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-29 02:30:16,089 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 02:30:16,089 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 1 case distinctions, treesize of input 24 treesize of output 17 [2023-11-29 02:30:16,168 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:30:16,169 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2023-11-29 02:30:16,173 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 24 treesize of output 11 [2023-11-29 02:30:16,184 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 19 treesize of output 11 [2023-11-29 02:30:16,448 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 27 treesize of output 15 [2023-11-29 02:30:16,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-29 02:30:16,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:30:16,510 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:30:16,696 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 69 treesize of output 49 [2023-11-29 02:30:16,708 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_720 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_720) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_722 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_722) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-11-29 02:30:16,846 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_722 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_717))) (= (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_716) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_722) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_720 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_716 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_716))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store .cse1 .cse2 v_ArrVal_720) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse2))))) is different from false [2023-11-29 02:30:16,869 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_720 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_716 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_716))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_720) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_722 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_717))) (= (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (select (select (store .cse3 (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_716) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_722) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2023-11-29 02:30:16,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:30:16,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 51 treesize of output 44 [2023-11-29 02:30:16,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:30:16,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 35 treesize of output 36 [2023-11-29 02:30:16,901 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 64 treesize of output 56 [2023-11-29 02:30:16,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:30:16,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 394 treesize of output 337 [2023-11-29 02:30:16,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:30:16,948 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 64 treesize of output 63 [2023-11-29 02:30:16,956 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 54 treesize of output 50 [2023-11-29 02:30:16,962 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 74 treesize of output 68 [2023-11-29 02:30:17,037 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 02:30:17,037 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 1 case distinctions, treesize of input 51 treesize of output 1 [2023-11-29 02:30:21,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:30:21,193 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:30:21,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268187830] [2023-11-29 02:30:21,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [268187830] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:30:21,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:30:21,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2023-11-29 02:30:21,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212587759] [2023-11-29 02:30:21,193 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:30:21,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-29 02:30:21,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:30:21,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-29 02:30:21,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=290, Unknown=11, NotChecked=108, Total=462 [2023-11-29 02:30:21,195 INFO L87 Difference]: Start difference. First operand 209 states and 255 transitions. Second operand has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 21 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:24,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:30:24,164 INFO L93 Difference]: Finished difference Result 264 states and 310 transitions. [2023-11-29 02:30:24,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 02:30:24,164 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 21 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-29 02:30:24,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:30:24,165 INFO L225 Difference]: With dead ends: 264 [2023-11-29 02:30:24,165 INFO L226 Difference]: Without dead ends: 264 [2023-11-29 02:30:24,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=144, Invalid=667, Unknown=13, NotChecked=168, Total=992 [2023-11-29 02:30:24,166 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 529 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 1746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 771 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:30:24,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 646 Invalid, 1746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 941 Invalid, 0 Unknown, 771 Unchecked, 2.5s Time] [2023-11-29 02:30:24,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2023-11-29 02:30:24,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 210. [2023-11-29 02:30:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 173 states have (on average 1.4508670520231215) internal successors, (251), 208 states have internal predecessors, (251), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:24,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 256 transitions. [2023-11-29 02:30:24,171 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 256 transitions. Word has length 34 [2023-11-29 02:30:24,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:30:24,171 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 256 transitions. [2023-11-29 02:30:24,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 21 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:24,171 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 256 transitions. [2023-11-29 02:30:24,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 02:30:24,171 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:30:24,171 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 02:30:24,175 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 (20)] Ended with exit code 0 [2023-11-29 02:30:24,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:30:24,372 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:30:24,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:24,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1397792729, now seen corresponding path program 1 times [2023-11-29 02:30:24,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:30:24,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143065850] [2023-11-29 02:30:24,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:24,373 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 [2023-11-29 02:30:24,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:30:24,374 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 02:30:24,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 (21)] Waiting until timeout for monitored process [2023-11-29 02:30:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:24,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-29 02:30:24,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:30:24,620 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 6 treesize of output 7 [2023-11-29 02:30:24,675 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:30:24,675 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 [2023-11-29 02:30:24,683 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 6 treesize of output 5 [2023-11-29 02:30:24,731 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 15 treesize of output 1 [2023-11-29 02:30:24,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-29 02:30:24,869 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:30:24,869 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:30:24,879 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 24 treesize of output 11 [2023-11-29 02:30:24,956 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 02:30:24,956 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-29 02:30:24,963 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 [2023-11-29 02:30:24,985 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 02:30:24,985 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 1 case distinctions, treesize of input 33 treesize of output 24 [2023-11-29 02:30:25,064 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:30:25,064 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:30:25,069 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 24 treesize of output 11 [2023-11-29 02:30:25,276 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 25 treesize of output 13 [2023-11-29 02:30:25,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-29 02:30:25,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:30:25,327 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:30:25,760 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_779 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_780) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_779) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_780 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_780) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) is different from false [2023-11-29 02:30:25,829 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_780 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_780) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_779 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_780) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_779) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2023-11-29 02:30:26,012 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_775 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_776 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_775) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_776) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_780) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_775 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_776))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_775) .cse1 v_ArrVal_780) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_779) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2023-11-29 02:30:26,106 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_775 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_776))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_775) .cse1 v_ArrVal_780) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_779) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_775 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_776 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_775) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_776) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_780) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse3 (bvadd (_ bv4 32) .cse3)))))) is different from false [2023-11-29 02:30:26,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:30:26,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 71 treesize of output 64 [2023-11-29 02:30:26,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:30:26,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 55 treesize of output 48 [2023-11-29 02:30:26,151 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 80 treesize of output 68 [2023-11-29 02:30:26,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:30:26,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 212 treesize of output 195 [2023-11-29 02:30:26,211 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 70 treesize of output 66 [2023-11-29 02:30:26,228 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 66 treesize of output 62 [2023-11-29 02:30:26,234 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 92 treesize of output 80 [2023-11-29 02:30:26,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:30:26,387 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 1 case distinctions, treesize of input 73 treesize of output 74 [2023-11-29 02:30:26,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:30:26,410 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 1 case distinctions, treesize of input 65 treesize of output 50 [2023-11-29 02:30:26,415 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:30:26,416 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:30:26,420 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2023-11-29 02:30:26,425 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:30:26,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 02:30:26,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:30:26,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:30:26,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143065850] [2023-11-29 02:30:26,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1143065850] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:30:26,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:30:26,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2023-11-29 02:30:26,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119576462] [2023-11-29 02:30:26,612 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:30:26,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 02:30:26,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:30:26,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 02:30:26,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=197, Unknown=4, NotChecked=124, Total=380 [2023-11-29 02:30:26,614 INFO L87 Difference]: Start difference. First operand 210 states and 256 transitions. Second operand has 20 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 19 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:30,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:30:30,349 INFO L93 Difference]: Finished difference Result 291 states and 341 transitions. [2023-11-29 02:30:30,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 02:30:30,350 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 19 states have internal predecessors, (63), 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 33 [2023-11-29 02:30:30,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:30:30,351 INFO L225 Difference]: With dead ends: 291 [2023-11-29 02:30:30,351 INFO L226 Difference]: Without dead ends: 291 [2023-11-29 02:30:30,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=149, Invalid=513, Unknown=4, NotChecked=204, Total=870 [2023-11-29 02:30:30,352 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 508 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 2064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1125 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:30:30,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 530 Invalid, 2064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 875 Invalid, 0 Unknown, 1125 Unchecked, 3.1s Time] [2023-11-29 02:30:30,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2023-11-29 02:30:30,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 198. [2023-11-29 02:30:30,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 168 states have (on average 1.3988095238095237) internal successors, (235), 196 states have internal predecessors, (235), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:30,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 240 transitions. [2023-11-29 02:30:30,357 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 240 transitions. Word has length 33 [2023-11-29 02:30:30,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:30:30,357 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 240 transitions. [2023-11-29 02:30:30,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 19 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:30,357 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 240 transitions. [2023-11-29 02:30:30,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 02:30:30,358 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:30:30,358 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:30:30,362 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 (21)] Ended with exit code 0 [2023-11-29 02:30:30,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:30:30,559 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:30:30,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:30,559 INFO L85 PathProgramCache]: Analyzing trace with hash -451129217, now seen corresponding path program 1 times [2023-11-29 02:30:30,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:30:30,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134578917] [2023-11-29 02:30:30,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:30,560 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 [2023-11-29 02:30:30,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:30:30,561 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 02:30:30,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 (22)] Waiting until timeout for monitored process [2023-11-29 02:30:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:30,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 02:30:30,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:30:30,700 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 02:30:30,700 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:30:30,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:30:30,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134578917] [2023-11-29 02:30:30,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [134578917] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:30,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:30,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:30:30,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473086739] [2023-11-29 02:30:30,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:30,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:30:30,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:30:30,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:30:30,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:30:30,701 INFO L87 Difference]: Start difference. First operand 198 states and 240 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:30,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:30:30,872 INFO L93 Difference]: Finished difference Result 221 states and 263 transitions. [2023-11-29 02:30:30,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:30:30,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 34 [2023-11-29 02:30:30,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:30:30,874 INFO L225 Difference]: With dead ends: 221 [2023-11-29 02:30:30,874 INFO L226 Difference]: Without dead ends: 221 [2023-11-29 02:30:30,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:30:30,875 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 35 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:30:30,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 186 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:30:30,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2023-11-29 02:30:30,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 198. [2023-11-29 02:30:30,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 168 states have (on average 1.3869047619047619) internal successors, (233), 196 states have internal predecessors, (233), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:30,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 238 transitions. [2023-11-29 02:30:30,881 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 238 transitions. Word has length 34 [2023-11-29 02:30:30,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:30:30,881 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 238 transitions. [2023-11-29 02:30:30,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:30,881 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 238 transitions. [2023-11-29 02:30:30,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 02:30:30,882 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:30:30,882 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 02:30:30,885 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 (22)] Ended with exit code 0 [2023-11-29 02:30:31,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:30:31,082 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:30:31,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:31,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1438326198, now seen corresponding path program 1 times [2023-11-29 02:30:31,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:30:31,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567825406] [2023-11-29 02:30:31,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:31,083 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 [2023-11-29 02:30:31,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:30:31,084 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 02:30:31,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 (23)] Waiting until timeout for monitored process [2023-11-29 02:30:31,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:31,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 02:30:31,288 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:30:31,469 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:30:31,469 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 [2023-11-29 02:30:31,500 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 11 [2023-11-29 02:30:31,507 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 11 [2023-11-29 02:30:31,519 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 11 [2023-11-29 02:30:31,525 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 11 [2023-11-29 02:30:31,539 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 11 [2023-11-29 02:30:31,542 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 11 [2023-11-29 02:30:31,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:30:31,586 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:30:31,611 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_924 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tmp~0#1.base| v_ArrVal_924) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_923 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tmp~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)))) is different from false [2023-11-29 02:30:31,653 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_27| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_27|))) (forall ((v_ArrVal_923 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~tmp~0#1.base_27| v_ArrVal_923) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))))) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_27| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_27|))) (forall ((v_ArrVal_924 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~tmp~0#1.base_27| v_ArrVal_924) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)))))) is different from false [2023-11-29 02:30:31,820 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 55 treesize of output 47 [2023-11-29 02:30:31,825 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 54 treesize of output 46 [2023-11-29 02:30:31,873 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-11-29 02:30:31,874 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 16 treesize of output 15 [2023-11-29 02:30:31,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:30:31,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:30:31,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567825406] [2023-11-29 02:30:31,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567825406] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:30:31,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:30:31,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2023-11-29 02:30:31,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767866071] [2023-11-29 02:30:31,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:30:31,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 02:30:31,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:30:31,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 02:30:31,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=87, Unknown=2, NotChecked=38, Total=156 [2023-11-29 02:30:31,884 INFO L87 Difference]: Start difference. First operand 198 states and 238 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:33,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:30:33,417 INFO L93 Difference]: Finished difference Result 239 states and 278 transitions. [2023-11-29 02:30:33,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 02:30:33,417 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 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 34 [2023-11-29 02:30:33,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:30:33,419 INFO L225 Difference]: With dead ends: 239 [2023-11-29 02:30:33,419 INFO L226 Difference]: Without dead ends: 239 [2023-11-29 02:30:33,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=357, Unknown=2, NotChecked=86, Total=600 [2023-11-29 02:30:33,420 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 384 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 404 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:30:33,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 274 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 424 Invalid, 0 Unknown, 404 Unchecked, 1.2s Time] [2023-11-29 02:30:33,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-11-29 02:30:33,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 208. [2023-11-29 02:30:33,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 179 states have (on average 1.3575418994413408) internal successors, (243), 206 states have internal predecessors, (243), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:33,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 248 transitions. [2023-11-29 02:30:33,424 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 248 transitions. Word has length 34 [2023-11-29 02:30:33,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:30:33,424 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 248 transitions. [2023-11-29 02:30:33,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:33,424 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 248 transitions. [2023-11-29 02:30:33,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 02:30:33,425 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:30:33,425 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:30:33,430 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 (23)] Forceful destruction successful, exit code 0 [2023-11-29 02:30:33,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:30:33,625 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:30:33,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:33,626 INFO L85 PathProgramCache]: Analyzing trace with hash 92463071, now seen corresponding path program 2 times [2023-11-29 02:30:33,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:30:33,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1988833273] [2023-11-29 02:30:33,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 02:30:33,626 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 [2023-11-29 02:30:33,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:30:33,627 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 02:30:33,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 (24)] Waiting until timeout for monitored process [2023-11-29 02:30:33,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 02:30:33,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:30:33,892 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-29 02:30:33,895 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:30:33,898 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 6 treesize of output 7 [2023-11-29 02:30:33,978 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 02:30:33,979 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 19 treesize of output 27 [2023-11-29 02:30:34,034 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 15 treesize of output 1 [2023-11-29 02:30:34,156 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:30:34,157 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 02:30:34,241 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 02:30:34,242 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 1 case distinctions, treesize of input 35 treesize of output 26 [2023-11-29 02:30:34,294 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 02:30:34,294 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 1 case distinctions, treesize of input 35 treesize of output 26 [2023-11-29 02:30:34,343 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-29 02:30:34,343 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 24 treesize of output 26 [2023-11-29 02:30:34,412 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-11-29 02:30:34,412 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 1 case distinctions, treesize of input 43 treesize of output 23 [2023-11-29 02:30:34,596 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-11-29 02:30:34,596 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 42 [2023-11-29 02:30:34,799 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-29 02:30:34,799 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 67 treesize of output 50 [2023-11-29 02:30:34,915 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-29 02:30:34,916 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 59 [2023-11-29 02:30:35,227 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 02:30:35,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 26 [2023-11-29 02:30:35,260 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:30:35,261 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:30:35,350 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1006 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1006) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2023-11-29 02:30:35,373 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1006 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1006) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:30:35,505 INFO L349 Elim1Store]: treesize reduction 7, result has 80.0 percent of original size [2023-11-29 02:30:35,506 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 41 treesize of output 40 [2023-11-29 02:30:35,515 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1006 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1004 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1004))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1006)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) is different from false [2023-11-29 02:30:35,531 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_ArrVal_1006 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1004 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1004))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1006)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) is different from false [2023-11-29 02:30:35,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:30:35,753 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 1 case distinctions, treesize of input 32 treesize of output 33 [2023-11-29 02:30:35,771 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_ArrVal_1006 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1004 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select v_arrayElimArr_16 |ULTIMATE.start_main_~x~0#1.offset|))) (or (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_16) .cse1 v_ArrVal_1004))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1006)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| .cse1) (_ bv0 1)))))) is different from false [2023-11-29 02:30:35,838 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1006 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.offset_149| (_ BitVec 32)) (v_ArrVal_1004 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select v_arrayElimArr_16 |v_ULTIMATE.start_main_~x~0#1.offset_149|))) (or (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_16) .cse2 v_ArrVal_1004))) (store .cse1 (select (select .cse1 .cse0) |v_ULTIMATE.start_main_~x~0#1.offset_149|) v_ArrVal_1006)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| .cse2)))))) is different from false [2023-11-29 02:30:35,867 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1000 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1006 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.offset_149| (_ BitVec 32)) (v_ArrVal_1004 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_16 |v_ULTIMATE.start_main_~x~0#1.offset_149|))) (or (not (= (_ bv0 1) (select |c_#valid| .cse0))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1000))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse1 (select (select (let ((.cse2 (store (store .cse3 .cse1 v_arrayElimArr_16) .cse0 v_ArrVal_1004))) (store .cse2 (select (select .cse2 .cse1) |v_ULTIMATE.start_main_~x~0#1.offset_149|) v_ArrVal_1006)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2023-11-29 02:30:35,895 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1000 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1006 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.offset_149| (_ BitVec 32)) (v_ArrVal_1004 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select v_arrayElimArr_16 |v_ULTIMATE.start_main_~x~0#1.offset_149|))) (or (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1000))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (let ((.cse0 (store (store .cse2 .cse1 v_arrayElimArr_16) .cse3 v_ArrVal_1004))) (store .cse0 (select (select .cse0 .cse1) |v_ULTIMATE.start_main_~x~0#1.offset_149|) v_ArrVal_1006)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse1))) (not (= (_ bv0 1) (select |c_#valid| .cse3)))))) is different from false [2023-11-29 02:30:35,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:30:35,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 112 treesize of output 73 [2023-11-29 02:30:35,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:30:35,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6578 treesize of output 5657 [2023-11-29 02:30:36,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:30:36,199 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 1410 treesize of output 1246 [2023-11-29 02:30:36,227 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 1238 treesize of output 1190 [2023-11-29 02:30:36,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:30:36,274 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 1198 treesize of output 1108 [2023-11-29 02:30:36,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:30:36,320 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 1094 treesize of output 1050 [2023-11-29 02:31:06,355 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-29 02:31:06,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:31:06,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1988833273] [2023-11-29 02:31:06,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1988833273] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:31:06,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:31:06,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 29 [2023-11-29 02:31:06,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085269506] [2023-11-29 02:31:06,356 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:31:06,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-29 02:31:06,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:31:06,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 02:31:06,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=412, Unknown=27, NotChecked=392, Total=930 [2023-11-29 02:31:06,358 INFO L87 Difference]: Start difference. First operand 208 states and 248 transitions. Second operand has 31 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 30 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:31:10,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:31:15,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:31:20,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:31:24,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:31:24,282 INFO L93 Difference]: Finished difference Result 380 states and 444 transitions. [2023-11-29 02:31:24,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-29 02:31:24,282 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 30 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-11-29 02:31:24,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:31:24,284 INFO L225 Difference]: With dead ends: 380 [2023-11-29 02:31:24,284 INFO L226 Difference]: Without dead ends: 380 [2023-11-29 02:31:24,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 30.0s TimeCoverageRelationStatistics Valid=293, Invalid=1347, Unknown=32, NotChecked=680, Total=2352 [2023-11-29 02:31:24,286 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 501 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 59 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 4009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 2681 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:31:24,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 993 Invalid, 4009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1264 Invalid, 5 Unknown, 2681 Unchecked, 16.5s Time] [2023-11-29 02:31:24,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2023-11-29 02:31:24,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 244. [2023-11-29 02:31:24,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 215 states have (on average 1.3395348837209302) internal successors, (288), 242 states have internal predecessors, (288), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:31:24,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 293 transitions. [2023-11-29 02:31:24,291 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 293 transitions. Word has length 34 [2023-11-29 02:31:24,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:31:24,291 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 293 transitions. [2023-11-29 02:31:24,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 30 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:31:24,291 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 293 transitions. [2023-11-29 02:31:24,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 02:31:24,292 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:31:24,292 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:31:24,297 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 (24)] Ended with exit code 0 [2023-11-29 02:31:24,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 02:31:24,493 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-11-29 02:31:24,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:31:24,493 INFO L85 PathProgramCache]: Analyzing trace with hash 92463072, now seen corresponding path program 2 times [2023-11-29 02:31:24,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:31:24,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440361984] [2023-11-29 02:31:24,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 02:31:24,493 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 [2023-11-29 02:31:24,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:31:24,494 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 02:31:24,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4dcf3391-812e-4187-9d90-c146dbb95f2d/bin/uautomizer-verify-BQ2R08f2Ya/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 (25)] Waiting until timeout for monitored process [2023-11-29 02:31:24,754 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 02:31:24,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:31:24,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-29 02:31:24,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:31:24,772 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 6 treesize of output 7 [2023-11-29 02:31:24,869 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 02:31:24,869 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 19 treesize of output 27 [2023-11-29 02:31:24,890 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 6 treesize of output 5 [2023-11-29 02:31:24,975 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 15 treesize of output 1 [2023-11-29 02:31:24,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-11-29 02:31:25,158 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:31:25,158 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2023-11-29 02:31:25,169 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 24 treesize of output 11 [2023-11-29 02:31:25,305 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 02:31:25,305 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 1 case distinctions, treesize of input 44 treesize of output 33 [2023-11-29 02:31:25,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:31:25,324 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 11 [2023-11-29 02:31:25,413 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 02:31:25,413 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-29 02:31:25,438 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 02:31:25,439 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 1 case distinctions, treesize of input 44 treesize of output 33 [2023-11-29 02:31:25,541 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 02:31:25,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 18 treesize of output 21 [2023-11-29 02:31:25,580 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-29 02:31:25,581 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 24 treesize of output 26 [2023-11-29 02:31:25,679 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-11-29 02:31:25,680 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 1 case distinctions, treesize of input 52 treesize of output 28 [2023-11-29 02:31:25,711 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 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 02:31:25,923 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-11-29 02:31:25,924 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 54 [2023-11-29 02:31:25,939 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 24 treesize of output 11 [2023-11-29 02:31:26,069 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 02:31:26,069 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-29 02:31:26,118 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-29 02:31:26,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 65 treesize of output 48 [2023-11-29 02:31:26,278 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-29 02:31:26,279 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 69 [2023-11-29 02:31:26,292 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 0 case distinctions, treesize of input 32 treesize of output 11 [2023-11-29 02:31:26,626 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 02:31:26,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 24 [2023-11-29 02:31:26,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-29 02:31:26,664 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:31:26,664 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:31:26,997 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1099 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1099) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_1098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1099 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1099) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1098) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-11-29 02:31:27,062 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1099 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1099) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1098) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1099 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1099) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-11-29 02:31:27,351 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1095 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1099 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1094) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1095) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1099) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_1094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1095 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1099 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1095))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1094) .cse1 v_ArrVal_1099) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1098) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2023-11-29 02:31:27,540 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1095 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1099 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1094) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1095) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1099) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_1094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1095 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1099 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1095))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1094) .cse2 v_ArrVal_1099) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1098) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) is different from false [2023-11-29 02:31:27,654 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (forall ((v_ArrVal_1094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1095 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1099 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_ArrVal_1093 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1095))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1093) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1094) .cse0 v_ArrVal_1099) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1098) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_1094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1095 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1099 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_ArrVal_1093 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1093) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1094) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1095) |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1099) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-11-29 02:31:27,747 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_35| (_ BitVec 32))) (or (forall ((v_ArrVal_1094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1095 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1091 (_ BitVec 32)) (v_ArrVal_1098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1099 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_ArrVal_1093 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc3#1.base_35|)) |v_ULTIMATE.start_main_#t~malloc3#1.base_35| v_ArrVal_1095))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1093) |v_ULTIMATE.start_main_#t~malloc3#1.base_35| v_ArrVal_1094) .cse0 v_ArrVal_1099) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc3#1.base_35| v_ArrVal_1091) (select (select (store .cse1 .cse0 v_ArrVal_1098) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_35|))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_35| (_ BitVec 32))) (or (forall ((v_ArrVal_1094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1095 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1099 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_ArrVal_1093 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1093) |v_ULTIMATE.start_main_#t~malloc3#1.base_35| v_ArrVal_1094) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc3#1.base_35|)) |v_ULTIMATE.start_main_#t~malloc3#1.base_35| v_ArrVal_1095) |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1099) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_35|))))))) is different from false [2023-11-29 02:31:27,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:31:27,806 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 1 case distinctions, treesize of input 65 treesize of output 63 [2023-11-29 02:31:27,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:31:27,842 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 1 case distinctions, treesize of input 59 treesize of output 60 [2023-11-29 02:31:27,879 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1095 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_19 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1099 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_ArrVal_1093 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_19 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (_ bv0 1) (select |c_#valid| .cse0))) (let ((.cse1 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1093) .cse0 v_ArrVal_1094) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_19) .cse0 v_ArrVal_1095) |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1099) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) (forall ((v_ArrVal_1094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1095 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1091 (_ BitVec 32)) (v_ArrVal_1098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1099 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_ArrVal_1093 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select v_arrayElimArr_18 |ULTIMATE.start_main_~x~0#1.offset|))) (or (let ((.cse4 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_18) .cse2 v_ArrVal_1095))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1093) .cse2 v_ArrVal_1094) .cse3 v_ArrVal_1099) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select (store |c_#length| .cse2 v_ArrVal_1091) (select (select (store .cse4 .cse3 v_ArrVal_1098) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (not (= (_ bv0 1) (select |c_#valid| .cse2))))))) is different from false [2023-11-29 02:31:28,056 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1095 (Array (_ BitVec 32) (_ BitVec 32))) (v_subst_3 (_ BitVec 32)) (v_arrayElimArr_19 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1099 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1093 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select v_arrayElimArr_19 v_subst_3))) (or (let ((.cse0 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1093) .cse2 v_ArrVal_1094) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_arrayElimArr_19) .cse2 v_ArrVal_1095) .cse1) v_subst_3) v_ArrVal_1099) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0))) (not (= (_ bv0 1) (select |c_#valid| .cse2)))))) (forall ((v_ArrVal_1094 (Array (_ BitVec 32) (_ BitVec 32))) (v_subst_4 (_ BitVec 32)) (v_ArrVal_1095 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1091 (_ BitVec 32)) (v_ArrVal_1098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1099 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1093 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select v_arrayElimArr_18 v_subst_4))) (or (not (= (select |c_#valid| .cse3) (_ bv0 1))) (let ((.cse5 (store (store |c_#memory_$Pointer$#1.base| .cse1 v_arrayElimArr_18) .cse3 v_ArrVal_1095))) (let ((.cse4 (select (select .cse5 .cse1) v_subst_4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1093) .cse3 v_ArrVal_1094) .cse4 v_ArrVal_1099) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select (store |c_#length| .cse3 v_ArrVal_1091) (select (select (store .cse5 .cse4 v_ArrVal_1098) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))))) is different from false [2023-11-29 02:31:28,136 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1085 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1086 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1094 (Array (_ BitVec 32) (_ BitVec 32))) (v_subst_4 (_ BitVec 32)) (v_ArrVal_1095 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1091 (_ BitVec 32)) (v_ArrVal_1098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1099 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1093 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_18 v_subst_4))) (or (not (= (select |c_#valid| .cse0) (_ bv0 1))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1086))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse3 (store (store .cse4 .cse1 v_arrayElimArr_18) .cse0 v_ArrVal_1095))) (let ((.cse2 (select (select .cse3 .cse1) v_subst_4))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1085) .cse1 v_ArrVal_1093) .cse0 v_ArrVal_1094) .cse2 v_ArrVal_1099) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (store |c_#length| .cse0 v_ArrVal_1091) (select (select (store .cse3 .cse2 v_ArrVal_1098) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))))) (forall ((v_ArrVal_1085 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1086 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1095 (Array (_ BitVec 32) (_ BitVec 32))) (v_subst_3 (_ BitVec 32)) (v_arrayElimArr_19 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1099 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1093 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select v_arrayElimArr_19 v_subst_3))) (or (let ((.cse5 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1086))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1085) .cse6 v_ArrVal_1093) .cse7 v_ArrVal_1094) (select (select (store (store .cse8 .cse6 v_arrayElimArr_19) .cse7 v_ArrVal_1095) .cse6) v_subst_3) v_ArrVal_1099))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32)))) (not (= (_ bv0 1) (select |c_#valid| .cse7))))))) is different from false [2023-11-29 02:31:28,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:31:28,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 195 treesize of output 188 [2023-11-29 02:31:28,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:31:28,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 179 treesize of output 124 [2023-11-29 02:31:28,457 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 276 treesize of output 248 [2023-11-29 02:31:28,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:31:28,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2828 treesize of output 2747 [2023-11-29 02:31:28,590 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 577 treesize of output 537 [2023-11-29 02:31:28,605 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 816 treesize of output 744 [2023-11-29 02:31:28,620 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 744 treesize of output 736 [2023-11-29 02:31:28,664 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 485 treesize of output 461 [2023-11-29 02:31:28,678 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 720 treesize of output 670 [2023-11-29 02:31:28,693 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 664 treesize of output 652 [2023-11-29 02:31:28,709 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 652 treesize of output 628 [2023-11-29 02:31:30,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:31:30,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 200 treesize of output 201 [2023-11-29 02:31:30,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:31:30,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 192 treesize of output 129 [2023-11-29 02:31:30,685 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:31:30,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:31:30,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 4532 treesize of output 4107 [2023-11-29 02:31:30,919 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:31:30,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:31:30,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11450 treesize of output 11201 [2023-11-29 02:31:31,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:31:31,217 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 3390 treesize of output 3000 [2023-11-29 02:31:31,262 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 2986 treesize of output 2890 [2023-11-29 02:31:31,311 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 2890 treesize of output 2826 [2023-11-29 02:31:31,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:31:31,391 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 2826 treesize of output 2606 [2023-11-29 02:31:31,452 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 2598 treesize of output 2490 [2023-11-29 02:31:31,500 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 2490 treesize of output 2458 [2023-11-29 02:31:31,547 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 2458 treesize of output 2394