./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI --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 c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:51:40,092 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:51:40,157 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 21:51:40,163 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:51:40,163 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:51:40,190 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:51:40,191 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:51:40,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:51:40,193 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:51:40,193 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:51:40,194 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:51:40,194 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:51:40,195 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:51:40,196 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:51:40,196 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:51:40,197 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:51:40,198 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:51:40,198 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:51:40,199 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:51:40,199 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:51:40,200 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:51:40,200 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:51:40,201 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:51:40,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:51:40,202 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:51:40,202 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:51:40,203 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:51:40,203 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:51:40,203 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:51:40,204 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:51:40,204 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:51:40,205 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:51:40,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:51:40,206 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:51:40,206 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:51:40,206 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:51:40,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:51:40,207 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:51:40,207 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:51:40,207 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:51:40,207 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:51:40,208 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_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/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_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI 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 -> c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 [2023-11-24 21:51:40,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:51:40,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:51:40,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:51:40,482 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:51:40,483 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:51:40,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/list-simple/dll2n_update_all.i [2023-11-24 21:51:43,648 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:51:43,962 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:51:43,963 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/sv-benchmarks/c/list-simple/dll2n_update_all.i [2023-11-24 21:51:43,997 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/data/e5268d350/e4c0f66eee9b457f9c64b1416e9df01a/FLAGae5cca2b0 [2023-11-24 21:51:44,012 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/data/e5268d350/e4c0f66eee9b457f9c64b1416e9df01a [2023-11-24 21:51:44,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:51:44,017 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:51:44,018 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:51:44,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:51:44,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:51:44,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:51:44" (1/1) ... [2023-11-24 21:51:44,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d984578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:51:44, skipping insertion in model container [2023-11-24 21:51:44,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:51:44" (1/1) ... [2023-11-24 21:51:44,081 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:51:44,433 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:51:44,450 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:51:44,536 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:51:44,572 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:51:44,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:51:44 WrapperNode [2023-11-24 21:51:44,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:51:44,575 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:51:44,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:51:44,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:51:44,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:51:44" (1/1) ... [2023-11-24 21:51:44,619 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:51:44" (1/1) ... [2023-11-24 21:51:44,655 INFO L138 Inliner]: procedures = 126, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 120 [2023-11-24 21:51:44,656 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:51:44,656 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:51:44,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:51:44,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:51:44,669 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:51:44" (1/1) ... [2023-11-24 21:51:44,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:51:44" (1/1) ... [2023-11-24 21:51:44,690 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:51:44" (1/1) ... [2023-11-24 21:51:44,710 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2023-11-24 21:51:44,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:51:44" (1/1) ... [2023-11-24 21:51:44,710 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:51:44" (1/1) ... [2023-11-24 21:51:44,719 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:51:44" (1/1) ... [2023-11-24 21:51:44,726 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:51:44" (1/1) ... [2023-11-24 21:51:44,730 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:51:44" (1/1) ... [2023-11-24 21:51:44,742 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:51:44" (1/1) ... [2023-11-24 21:51:44,746 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:51:44,747 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:51:44,747 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:51:44,747 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:51:44,748 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:51:44" (1/1) ... [2023-11-24 21:51:44,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:51:44,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:51:44,785 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:51:44,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:51:44,825 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-24 21:51:44,826 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-24 21:51:44,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-24 21:51:44,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-24 21:51:44,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 21:51:44,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 21:51:44,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-24 21:51:44,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:51:44,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-24 21:51:44,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-24 21:51:44,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-24 21:51:44,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-24 21:51:44,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:51:44,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 21:51:44,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 21:51:44,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:51:44,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:51:44,957 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:51:44,960 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:51:45,006 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-24 21:51:45,340 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:51:45,412 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:51:45,413 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-24 21:51:45,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:51:45 BoogieIcfgContainer [2023-11-24 21:51:45,414 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:51:45,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:51:45,420 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:51:45,423 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:51:45,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:51:44" (1/3) ... [2023-11-24 21:51:45,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da9bdb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:51:45, skipping insertion in model container [2023-11-24 21:51:45,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:51:44" (2/3) ... [2023-11-24 21:51:45,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da9bdb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:51:45, skipping insertion in model container [2023-11-24 21:51:45,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:51:45" (3/3) ... [2023-11-24 21:51:45,430 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.i [2023-11-24 21:51:45,451 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:51:45,451 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2023-11-24 21:51:45,513 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:51:45,519 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;@744127a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:51:45,519 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-11-24 21:51:45,523 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 56 states have internal predecessors, (72), 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-24 21:51:45,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-24 21:51:45,530 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:51:45,531 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-24 21:51:45,531 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-24 21:51:45,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:51:45,537 INFO L85 PathProgramCache]: Analyzing trace with hash 6033865, now seen corresponding path program 1 times [2023-11-24 21:51:45,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:51:45,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812408038] [2023-11-24 21:51:45,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:51:45,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:51:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:51:45,845 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-24 21:51:45,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:51:45,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812408038] [2023-11-24 21:51:45,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812408038] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:51:45,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:51:45,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:51:45,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078793615] [2023-11-24 21:51:45,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:51:45,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:51:45,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:51:45,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:51:45,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:51:45,886 INFO L87 Difference]: Start difference. First operand has 58 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 56 states have internal predecessors, (72), 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:51:46,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:51:46,069 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2023-11-24 21:51:46,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:51:46,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-24 21:51:46,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:51:46,080 INFO L225 Difference]: With dead ends: 54 [2023-11-24 21:51:46,081 INFO L226 Difference]: Without dead ends: 50 [2023-11-24 21:51:46,082 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-24 21:51:46,086 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 12 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 21:51:46,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 67 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 21:51:46,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-24 21:51:46,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-11-24 21:51:46,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 49 states have internal predecessors, (56), 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-24 21:51:46,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2023-11-24 21:51:46,122 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 4 [2023-11-24 21:51:46,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:51:46,122 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2023-11-24 21:51:46,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:51:46,123 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2023-11-24 21:51:46,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-24 21:51:46,124 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:51:46,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-24 21:51:46,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:51:46,125 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-24 21:51:46,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:51:46,125 INFO L85 PathProgramCache]: Analyzing trace with hash 6033866, now seen corresponding path program 1 times [2023-11-24 21:51:46,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:51:46,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936373828] [2023-11-24 21:51:46,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:51:46,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:51:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:51:46,275 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-24 21:51:46,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:51:46,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936373828] [2023-11-24 21:51:46,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936373828] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:51:46,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:51:46,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:51:46,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624678532] [2023-11-24 21:51:46,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:51:46,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:51:46,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:51:46,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:51:46,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:51:46,280 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:51:46,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:51:46,330 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2023-11-24 21:51:46,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:51:46,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-24 21:51:46,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:51:46,332 INFO L225 Difference]: With dead ends: 47 [2023-11-24 21:51:46,332 INFO L226 Difference]: Without dead ends: 47 [2023-11-24 21:51:46,333 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-24 21:51:46,334 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 21:51:46,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 65 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 21:51:46,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-24 21:51:46,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-11-24 21:51:46,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 46 states have internal predecessors, (53), 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-24 21:51:46,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2023-11-24 21:51:46,342 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 4 [2023-11-24 21:51:46,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:51:46,343 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2023-11-24 21:51:46,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:51:46,343 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2023-11-24 21:51:46,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-24 21:51:46,344 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:51:46,344 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-24 21:51:46,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:51:46,345 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-24 21:51:46,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:51:46,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1506349614, now seen corresponding path program 1 times [2023-11-24 21:51:46,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:51:46,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112778955] [2023-11-24 21:51:46,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:51:46,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:51:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:51:46,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-24 21:51:46,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:51:46,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112778955] [2023-11-24 21:51:46,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112778955] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:51:46,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:51:46,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:51:46,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947502820] [2023-11-24 21:51:46,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:51:46,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:51:46,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:51:46,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:51:46,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:51:46,439 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:51:46,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:51:46,496 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2023-11-24 21:51:46,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:51:46,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-24 21:51:46,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:51:46,500 INFO L225 Difference]: With dead ends: 57 [2023-11-24 21:51:46,501 INFO L226 Difference]: Without dead ends: 57 [2023-11-24 21:51:46,501 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-24 21:51:46,504 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 10 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 21:51:46,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 79 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 21:51:46,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-24 21:51:46,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2023-11-24 21:51:46,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 47 states have internal predecessors, (54), 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-24 21:51:46,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2023-11-24 21:51:46,521 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 6 [2023-11-24 21:51:46,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:51:46,521 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2023-11-24 21:51:46,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:51:46,521 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2023-11-24 21:51:46,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-24 21:51:46,522 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:51:46,522 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:51:46,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 21:51:46,522 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-24 21:51:46,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:51:46,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1828366541, now seen corresponding path program 1 times [2023-11-24 21:51:46,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:51:46,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12597784] [2023-11-24 21:51:46,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:51:46,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:51:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:51:46,592 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-24 21:51:46,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:51:46,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12597784] [2023-11-24 21:51:46,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12597784] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:51:46,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:51:46,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:51:46,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529526521] [2023-11-24 21:51:46,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:51:46,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:51:46,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:51:46,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:51:46,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:51:46,595 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-24 21:51:46,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:51:46,630 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2023-11-24 21:51:46,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:51:46,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2023-11-24 21:51:46,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:51:46,631 INFO L225 Difference]: With dead ends: 54 [2023-11-24 21:51:46,631 INFO L226 Difference]: Without dead ends: 54 [2023-11-24 21:51:46,632 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-24 21:51:46,633 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 21:51:46,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 79 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 21:51:46,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-24 21:51:46,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2023-11-24 21:51:46,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 52 states have internal predecessors, (59), 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-24 21:51:46,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2023-11-24 21:51:46,645 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 8 [2023-11-24 21:51:46,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:51:46,645 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2023-11-24 21:51:46,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-24 21:51:46,646 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2023-11-24 21:51:46,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-24 21:51:46,646 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:51:46,646 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:51:46,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 21:51:46,647 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-24 21:51:46,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:51:46,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1117956245, now seen corresponding path program 1 times [2023-11-24 21:51:46,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:51:46,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542682612] [2023-11-24 21:51:46,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:51:46,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:51:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:51:46,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 21:51:46,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:51:46,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542682612] [2023-11-24 21:51:46,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542682612] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:51:46,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:51:46,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:51:46,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914485320] [2023-11-24 21:51:46,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:51:46,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:51:46,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:51:46,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:51:46,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:51:46,829 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:51:46,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:51:46,902 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2023-11-24 21:51:46,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:51:46,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-24 21:51:46,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:51:46,904 INFO L225 Difference]: With dead ends: 85 [2023-11-24 21:51:46,904 INFO L226 Difference]: Without dead ends: 85 [2023-11-24 21:51:46,905 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-24 21:51:46,906 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 35 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 21:51:46,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 116 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 21:51:46,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-24 21:51:46,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 55. [2023-11-24 21:51:46,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.631578947368421) internal successors, (62), 54 states have internal predecessors, (62), 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-24 21:51:46,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2023-11-24 21:51:46,912 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 13 [2023-11-24 21:51:46,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:51:46,913 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2023-11-24 21:51:46,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:51:46,913 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2023-11-24 21:51:46,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-24 21:51:46,914 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:51:46,914 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:51:46,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 21:51:46,914 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-24 21:51:46,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:51:46,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1117956300, now seen corresponding path program 1 times [2023-11-24 21:51:46,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:51:46,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179293356] [2023-11-24 21:51:46,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:51:46,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:51:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:51:47,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:51:47,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:51:47,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179293356] [2023-11-24 21:51:47,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179293356] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:51:47,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:51:47,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:51:47,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498840647] [2023-11-24 21:51:47,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:51:47,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:51:47,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:51:47,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:51:47,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:51:47,091 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:51:47,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:51:47,275 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2023-11-24 21:51:47,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:51:47,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-24 21:51:47,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:51:47,284 INFO L225 Difference]: With dead ends: 73 [2023-11-24 21:51:47,284 INFO L226 Difference]: Without dead ends: 73 [2023-11-24 21:51:47,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-24 21:51:47,288 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 59 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:51:47,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 92 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:51:47,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-24 21:51:47,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2023-11-24 21:51:47,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 56 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-24 21:51:47,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2023-11-24 21:51:47,308 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 13 [2023-11-24 21:51:47,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:51:47,308 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2023-11-24 21:51:47,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:51:47,309 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2023-11-24 21:51:47,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-24 21:51:47,310 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:51:47,310 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:51:47,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 21:51:47,311 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-24 21:51:47,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:51:47,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1117956299, now seen corresponding path program 1 times [2023-11-24 21:51:47,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:51:47,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962499707] [2023-11-24 21:51:47,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:51:47,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:51:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:51:47,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:51:47,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:51:47,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962499707] [2023-11-24 21:51:47,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962499707] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:51:47,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489921134] [2023-11-24 21:51:47,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:51:47,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:51:47,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:51:47,456 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:51:47,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-24 21:51:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:51:47,567 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 21:51:47,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:51:47,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:51:47,625 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:51:47,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:51:47,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489921134] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:51:47,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:51:47,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-11-24 21:51:47,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010736086] [2023-11-24 21:51:47,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:51:47,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:51:47,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:51:47,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:51:47,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:51:47,663 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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-24 21:51:47,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:51:47,696 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2023-11-24 21:51:47,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:51:47,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-24 21:51:47,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:51:47,697 INFO L225 Difference]: With dead ends: 59 [2023-11-24 21:51:47,697 INFO L226 Difference]: Without dead ends: 59 [2023-11-24 21:51:47,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:51:47,699 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 9 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 21:51:47,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 89 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 21:51:47,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-24 21:51:47,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-11-24 21:51:47,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 58 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-24 21:51:47,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2023-11-24 21:51:47,712 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 13 [2023-11-24 21:51:47,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:51:47,713 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2023-11-24 21:51:47,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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-24 21:51:47,715 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2023-11-24 21:51:47,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-24 21:51:47,716 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:51:47,716 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-11-24 21:51:47,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-24 21:51:47,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:51:47,929 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-24 21:51:47,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:51:47,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1016238795, now seen corresponding path program 1 times [2023-11-24 21:51:47,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:51:47,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585732206] [2023-11-24 21:51:47,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:51:47,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:51:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:51:48,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:51:48,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:51:48,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585732206] [2023-11-24 21:51:48,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585732206] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:51:48,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844540818] [2023-11-24 21:51:48,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:51:48,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:51:48,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:51:48,230 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:51:48,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 21:51:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:51:48,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-24 21:51:48,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:51:48,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-24 21:51:48,445 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-24 21:51:48,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 21:51:48,553 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 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-24 21:51:48,568 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 21:51:48,568 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-24 21:51:48,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:51:48,610 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:51:48,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:51:48,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844540818] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:51:48,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:51:48,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2023-11-24 21:51:48,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94789218] [2023-11-24 21:51:48,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:51:48,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-24 21:51:48,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:51:48,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-24 21:51:48,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-11-24 21:51:48,981 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 12 states have internal predecessors, (43), 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-24 21:51:49,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:51:49,234 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2023-11-24 21:51:49,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:51:49,238 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 12 states have internal predecessors, (43), 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 15 [2023-11-24 21:51:49,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:51:49,238 INFO L225 Difference]: With dead ends: 58 [2023-11-24 21:51:49,239 INFO L226 Difference]: Without dead ends: 58 [2023-11-24 21:51:49,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-11-24 21:51:49,240 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 22 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 21:51:49,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 215 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 21:51:49,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-11-24 21:51:49,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-11-24 21:51:49,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 57 states have internal predecessors, (68), 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-24 21:51:49,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2023-11-24 21:51:49,246 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 15 [2023-11-24 21:51:49,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:51:49,246 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2023-11-24 21:51:49,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 12 states have internal predecessors, (43), 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-24 21:51:49,246 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2023-11-24 21:51:49,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-24 21:51:49,247 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:51:49,247 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-24 21:51:49,256 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-24 21:51:49,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-24 21:51:49,456 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-24 21:51:49,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:51:49,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1560879960, now seen corresponding path program 2 times [2023-11-24 21:51:49,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:51:49,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676867028] [2023-11-24 21:51:49,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:51:49,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:51:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:51:49,527 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:51:49,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:51:49,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676867028] [2023-11-24 21:51:49,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676867028] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:51:49,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817831880] [2023-11-24 21:51:49,528 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 21:51:49,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:51:49,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:51:49,530 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:51:49,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-24 21:51:49,686 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 21:51:49,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 21:51:49,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 21:51:49,689 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:51:49,714 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:51:49,714 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:51:49,742 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:51:49,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817831880] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:51:49,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:51:49,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2023-11-24 21:51:49,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139102520] [2023-11-24 21:51:49,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:51:49,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:51:49,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:51:49,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:51:49,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:51:49,745 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-24 21:51:49,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:51:49,800 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2023-11-24 21:51:49,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:51:49,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2023-11-24 21:51:49,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:51:49,802 INFO L225 Difference]: With dead ends: 58 [2023-11-24 21:51:49,802 INFO L226 Difference]: Without dead ends: 58 [2023-11-24 21:51:49,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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-24 21:51:49,803 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 5 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 21:51:49,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 102 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 21:51:49,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-11-24 21:51:49,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-11-24 21:51:49,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 43 states have (on average 1.558139534883721) internal successors, (67), 57 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-24 21:51:49,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2023-11-24 21:51:49,807 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 20 [2023-11-24 21:51:49,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:51:49,808 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2023-11-24 21:51:49,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-24 21:51:49,808 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2023-11-24 21:51:49,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-24 21:51:49,809 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:51:49,809 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:51:49,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-24 21:51:50,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:51:50,018 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-24 21:51:50,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:51:50,019 INFO L85 PathProgramCache]: Analyzing trace with hash 644040353, now seen corresponding path program 1 times [2023-11-24 21:51:50,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:51:50,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442132957] [2023-11-24 21:51:50,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:51:50,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:51:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:51:50,274 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 21:51:50,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:51:50,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442132957] [2023-11-24 21:51:50,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442132957] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:51:50,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:51:50,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:51:50,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936085629] [2023-11-24 21:51:50,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:51:50,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:51:50,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:51:50,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:51:50,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:51:50,277 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-24 21:51:50,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:51:50,423 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2023-11-24 21:51:50,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:51:50,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 21 [2023-11-24 21:51:50,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:51:50,425 INFO L225 Difference]: With dead ends: 58 [2023-11-24 21:51:50,425 INFO L226 Difference]: Without dead ends: 58 [2023-11-24 21:51:50,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-24 21:51:50,426 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 51 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:51:50,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 102 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:51:50,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-11-24 21:51:50,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-11-24 21:51:50,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 57 states have internal predecessors, (65), 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-24 21:51:50,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2023-11-24 21:51:50,439 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 21 [2023-11-24 21:51:50,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:51:50,440 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2023-11-24 21:51:50,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-24 21:51:50,440 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2023-11-24 21:51:50,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-24 21:51:50,442 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:51:50,442 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:51:50,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 21:51:50,442 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-24 21:51:50,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:51:50,443 INFO L85 PathProgramCache]: Analyzing trace with hash 446255910, now seen corresponding path program 1 times [2023-11-24 21:51:50,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:51:50,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605684455] [2023-11-24 21:51:50,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:51:50,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:51:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:51:50,531 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-24 21:51:50,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:51:50,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605684455] [2023-11-24 21:51:50,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605684455] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:51:50,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:51:50,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:51:50,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108137723] [2023-11-24 21:51:50,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:51:50,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:51:50,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:51:50,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:51:50,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:51:50,534 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-24 21:51:50,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:51:50,569 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2023-11-24 21:51:50,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:51:50,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 23 [2023-11-24 21:51:50,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:51:50,571 INFO L225 Difference]: With dead ends: 71 [2023-11-24 21:51:50,571 INFO L226 Difference]: Without dead ends: 71 [2023-11-24 21:51:50,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:51:50,572 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 69 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 21:51:50,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 75 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 21:51:50,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-24 21:51:50,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 59. [2023-11-24 21:51:50,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 58 states have internal predecessors, (65), 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-24 21:51:50,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2023-11-24 21:51:50,576 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 23 [2023-11-24 21:51:50,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:51:50,578 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2023-11-24 21:51:50,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-24 21:51:50,578 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2023-11-24 21:51:50,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-24 21:51:50,580 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:51:50,580 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:51:50,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 21:51:50,581 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-24 21:51:50,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:51:50,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1824954876, now seen corresponding path program 1 times [2023-11-24 21:51:50,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:51:50,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462784720] [2023-11-24 21:51:50,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:51:50,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:51:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:51:50,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-24 21:51:50,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:51:50,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462784720] [2023-11-24 21:51:50,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462784720] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:51:50,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:51:50,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:51:50,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321754017] [2023-11-24 21:51:50,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:51:50,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:51:50,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:51:50,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:51:50,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:51:50,802 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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-24 21:51:50,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:51:50,938 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2023-11-24 21:51:50,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:51:50,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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 26 [2023-11-24 21:51:50,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:51:50,939 INFO L225 Difference]: With dead ends: 77 [2023-11-24 21:51:50,939 INFO L226 Difference]: Without dead ends: 77 [2023-11-24 21:51:50,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-24 21:51:50,940 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 50 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:51:50,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 92 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:51:50,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-24 21:51:50,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 62. [2023-11-24 21:51:50,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 61 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-24 21:51:50,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2023-11-24 21:51:50,944 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 26 [2023-11-24 21:51:50,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:51:50,944 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2023-11-24 21:51:50,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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-24 21:51:50,945 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2023-11-24 21:51:50,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-24 21:51:50,946 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:51:50,946 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:51:50,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 21:51:50,946 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-24 21:51:50,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:51:50,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1824954875, now seen corresponding path program 1 times [2023-11-24 21:51:50,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:51:50,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610300115] [2023-11-24 21:51:50,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:51:50,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:51:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:51:51,056 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-24 21:51:51,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:51:51,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610300115] [2023-11-24 21:51:51,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610300115] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:51:51,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93166603] [2023-11-24 21:51:51,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:51:51,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:51:51,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:51:51,059 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:51:51,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-24 21:51:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:51:51,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 21:51:51,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:51:51,278 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-24 21:51:51,278 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:51:51,327 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-24 21:51:51,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93166603] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:51:51,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:51:51,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-24 21:51:51,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562298699] [2023-11-24 21:51:51,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:51:51,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 21:51:51,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:51:51,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 21:51:51,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-11-24 21:51:51,330 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 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-24 21:51:51,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:51:51,409 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2023-11-24 21:51:51,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:51:51,410 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 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 26 [2023-11-24 21:51:51,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:51:51,412 INFO L225 Difference]: With dead ends: 103 [2023-11-24 21:51:51,413 INFO L226 Difference]: Without dead ends: 103 [2023-11-24 21:51:51,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:51:51,414 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 131 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:51:51,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 140 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:51:51,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-24 21:51:51,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 72. [2023-11-24 21:51:51,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 71 states have internal predecessors, (90), 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-24 21:51:51,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 90 transitions. [2023-11-24 21:51:51,418 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 90 transitions. Word has length 26 [2023-11-24 21:51:51,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:51:51,419 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 90 transitions. [2023-11-24 21:51:51,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 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-24 21:51:51,419 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2023-11-24 21:51:51,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-24 21:51:51,420 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:51:51,420 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:51:51,432 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-24 21:51:51,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-24 21:51:51,632 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-24 21:51:51,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:51:51,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1823567296, now seen corresponding path program 1 times [2023-11-24 21:51:51,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:51:51,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933098111] [2023-11-24 21:51:51,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:51:51,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:51:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:51:51,815 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-24 21:51:51,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:51:51,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933098111] [2023-11-24 21:51:51,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933098111] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:51:51,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686515391] [2023-11-24 21:51:51,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:51:51,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:51:51,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:51:51,817 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:51:51,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-24 21:51:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:51:51,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-24 21:51:51,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:51:52,011 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-24 21:51:52,011 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:51:52,042 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-24 21:51:52,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686515391] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:51:52,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:51:52,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2023-11-24 21:51:52,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844216570] [2023-11-24 21:51:52,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:51:52,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:51:52,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:51:52,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:51:52,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:51:52,045 INFO L87 Difference]: Start difference. First operand 72 states and 90 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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-24 21:51:52,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:51:52,138 INFO L93 Difference]: Finished difference Result 100 states and 118 transitions. [2023-11-24 21:51:52,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:51:52,139 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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 26 [2023-11-24 21:51:52,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:51:52,140 INFO L225 Difference]: With dead ends: 100 [2023-11-24 21:51:52,140 INFO L226 Difference]: Without dead ends: 100 [2023-11-24 21:51:52,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-24 21:51:52,141 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 59 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:51:52,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 157 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:51:52,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-24 21:51:52,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 75. [2023-11-24 21:51:52,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 74 states have internal predecessors, (94), 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-24 21:51:52,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 94 transitions. [2023-11-24 21:51:52,146 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 94 transitions. Word has length 26 [2023-11-24 21:51:52,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:51:52,146 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 94 transitions. [2023-11-24 21:51:52,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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-24 21:51:52,147 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2023-11-24 21:51:52,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-24 21:51:52,147 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:51:52,147 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:51:52,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-24 21:51:52,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-24 21:51:52,354 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-24 21:51:52,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:51:52,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1823567351, now seen corresponding path program 1 times [2023-11-24 21:51:52,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:51:52,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619703997] [2023-11-24 21:51:52,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:51:52,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:51:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:51:53,201 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 21:51:53,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:51:53,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619703997] [2023-11-24 21:51:53,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619703997] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:51:53,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007664874] [2023-11-24 21:51:53,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:51:53,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:51:53,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:51:53,203 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:51:53,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-24 21:51:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:51:53,378 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-24 21:51:53,382 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:51:53,387 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-24 21:51:53,426 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 21:51:53,427 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-24 21:51:53,448 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 11 treesize of output 7 [2023-11-24 21:51:53,465 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 19 treesize of output 18 [2023-11-24 21:51:53,541 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-24 21:51:53,542 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-24 21:51:53,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 21:51:53,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 21:51:53,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:51:53,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2023-11-24 21:51:53,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:51:53,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 16 [2023-11-24 21:51:53,858 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 21:51:53,859 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:51:53,901 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_728 (Array Int Int))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_728) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) 1) (not (= v_ArrVal_728 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_728 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))))) is different from false [2023-11-24 21:51:54,076 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2023-11-24 21:51:54,077 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 21 treesize of output 20 [2023-11-24 21:51:54,145 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2023-11-24 21:51:54,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:51:54,158 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 2 case distinctions, treesize of input 27 treesize of output 33 [2023-11-24 21:51:54,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:51:54,166 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 46 treesize of output 28 [2023-11-24 21:51:54,172 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-24 21:51:54,259 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-11-24 21:51:54,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007664874] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:51:54,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:51:54,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2023-11-24 21:51:54,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173742072] [2023-11-24 21:51:54,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:51:54,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-24 21:51:54,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:51:54,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-24 21:51:54,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=612, Unknown=8, NotChecked=102, Total=812 [2023-11-24 21:51:54,262 INFO L87 Difference]: Start difference. First operand 75 states and 94 transitions. Second operand has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 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-24 21:51:55,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:51:55,104 INFO L93 Difference]: Finished difference Result 137 states and 174 transitions. [2023-11-24 21:51:55,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-24 21:51:55,105 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 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 26 [2023-11-24 21:51:55,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:51:55,106 INFO L225 Difference]: With dead ends: 137 [2023-11-24 21:51:55,106 INFO L226 Difference]: Without dead ends: 137 [2023-11-24 21:51:55,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=238, Invalid=1094, Unknown=8, NotChecked=142, Total=1482 [2023-11-24 21:51:55,108 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 107 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-24 21:51:55,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 431 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 665 Invalid, 0 Unknown, 173 Unchecked, 0.5s Time] [2023-11-24 21:51:55,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-24 21:51:55,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 82. [2023-11-24 21:51:55,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 81 states have internal predecessors, (106), 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-24 21:51:55,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 106 transitions. [2023-11-24 21:51:55,112 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 106 transitions. Word has length 26 [2023-11-24 21:51:55,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:51:55,112 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 106 transitions. [2023-11-24 21:51:55,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 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-24 21:51:55,113 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2023-11-24 21:51:55,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-24 21:51:55,113 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:51:55,113 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:51:55,129 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-24 21:51:55,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-24 21:51:55,320 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-24 21:51:55,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:51:55,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1823567350, now seen corresponding path program 1 times [2023-11-24 21:51:55,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:51:55,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435217848] [2023-11-24 21:51:55,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:51:55,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:51:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:51:56,452 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 21:51:56,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:51:56,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435217848] [2023-11-24 21:51:56,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435217848] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:51:56,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148167947] [2023-11-24 21:51:56,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:51:56,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:51:56,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:51:56,455 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:51:56,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-24 21:51:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:51:56,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-24 21:51:56,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:51:56,661 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-24 21:51:56,743 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 21:51:56,744 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-24 21:51:56,798 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 11 treesize of output 7 [2023-11-24 21:51:56,804 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 11 treesize of output 7 [2023-11-24 21:51:56,852 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 19 treesize of output 18 [2023-11-24 21:51:56,864 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 19 treesize of output 18 [2023-11-24 21:51:56,955 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-24 21:51:56,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2023-11-24 21:51:56,975 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 31 treesize of output 16 [2023-11-24 21:51:57,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 21:51:57,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 21:51:57,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2023-11-24 21:51:57,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 21:51:57,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 21:51:57,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-24 21:51:57,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2023-11-24 21:51:57,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2023-11-24 21:51:57,515 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 21:51:57,515 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:51:57,686 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_844 (Array Int Int))) (or (forall ((v_ArrVal_843 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_843)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_844) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))) (not (= v_ArrVal_844 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_844 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))))) (forall ((v_ArrVal_843 Int)) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_843)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2023-11-24 21:51:57,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:51:57,986 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 46 treesize of output 50 [2023-11-24 21:51:58,148 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 0))) (.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_839 (Array Int Int))) (< (select (select (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_839) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 9))) (forall ((v_prenex_2 (Array Int Int))) (<= 0 (select (select (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (forall ((v_ArrVal_840 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_840) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) is different from false [2023-11-24 21:51:58,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:51:58,163 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 2 case distinctions, treesize of input 27 treesize of output 33 [2023-11-24 21:51:58,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:51:58,169 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 50 treesize of output 32 [2023-11-24 21:51:58,176 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-24 21:51:58,188 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-24 21:51:58,189 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 2 case distinctions, treesize of input 27 treesize of output 1 [2023-11-24 21:51:58,196 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-24 21:51:58,197 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 2 case distinctions, treesize of input 29 treesize of output 1 [2023-11-24 21:51:58,449 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-11-24 21:51:58,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148167947] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:51:58,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:51:58,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2023-11-24 21:51:58,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640105460] [2023-11-24 21:51:58,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:51:58,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-24 21:51:58,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:51:58,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-24 21:51:58,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=949, Unknown=14, NotChecked=126, Total=1190 [2023-11-24 21:51:58,454 INFO L87 Difference]: Start difference. First operand 82 states and 106 transitions. Second operand has 35 states, 34 states have (on average 2.235294117647059) internal successors, (76), 35 states have internal predecessors, (76), 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-24 21:51:59,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:51:59,906 INFO L93 Difference]: Finished difference Result 144 states and 184 transitions. [2023-11-24 21:51:59,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-24 21:51:59,906 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.235294117647059) internal successors, (76), 35 states have internal predecessors, (76), 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 26 [2023-11-24 21:51:59,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:51:59,908 INFO L225 Difference]: With dead ends: 144 [2023-11-24 21:51:59,908 INFO L226 Difference]: Without dead ends: 144 [2023-11-24 21:51:59,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=279, Invalid=1607, Unknown=14, NotChecked=170, Total=2070 [2023-11-24 21:51:59,909 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 173 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-24 21:51:59,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 498 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 642 Invalid, 0 Unknown, 170 Unchecked, 0.6s Time] [2023-11-24 21:51:59,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-11-24 21:51:59,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 87. [2023-11-24 21:51:59,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 72 states have (on average 1.5833333333333333) internal successors, (114), 86 states have internal predecessors, (114), 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-24 21:51:59,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 114 transitions. [2023-11-24 21:51:59,915 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 114 transitions. Word has length 26 [2023-11-24 21:51:59,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:51:59,915 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 114 transitions. [2023-11-24 21:51:59,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.235294117647059) internal successors, (76), 35 states have internal predecessors, (76), 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-24 21:51:59,916 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 114 transitions. [2023-11-24 21:51:59,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-24 21:51:59,920 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:51:59,920 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:51:59,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-24 21:52:00,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-24 21:52:00,121 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-24 21:52:00,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:00,122 INFO L85 PathProgramCache]: Analyzing trace with hash -550699417, now seen corresponding path program 2 times [2023-11-24 21:52:00,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:00,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118305777] [2023-11-24 21:52:00,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:00,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:00,210 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-24 21:52:00,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:00,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118305777] [2023-11-24 21:52:00,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118305777] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:52:00,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551679098] [2023-11-24 21:52:00,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 21:52:00,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:52:00,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:52:00,213 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:52:00,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-24 21:52:00,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 21:52:00,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 21:52:00,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 21:52:00,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:52:00,410 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-24 21:52:00,410 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:52:00,430 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-24 21:52:00,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551679098] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:52:00,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:52:00,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2023-11-24 21:52:00,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692609067] [2023-11-24 21:52:00,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:52:00,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:52:00,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:00,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:52:00,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:52:00,433 INFO L87 Difference]: Start difference. First operand 87 states and 114 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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-24 21:52:00,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:00,497 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2023-11-24 21:52:00,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:52:00,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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 29 [2023-11-24 21:52:00,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:00,499 INFO L225 Difference]: With dead ends: 88 [2023-11-24 21:52:00,499 INFO L226 Difference]: Without dead ends: 88 [2023-11-24 21:52:00,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:52:00,500 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 87 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:00,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 143 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:52:00,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-24 21:52:00,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2023-11-24 21:52:00,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 80 states have internal predecessors, (102), 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-24 21:52:00,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 102 transitions. [2023-11-24 21:52:00,504 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 102 transitions. Word has length 29 [2023-11-24 21:52:00,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:00,505 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 102 transitions. [2023-11-24 21:52:00,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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-24 21:52:00,505 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 102 transitions. [2023-11-24 21:52:00,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-24 21:52:00,506 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:00,506 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:00,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-24 21:52:00,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-24 21:52:00,712 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-24 21:52:00,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:00,713 INFO L85 PathProgramCache]: Analyzing trace with hash 802280508, now seen corresponding path program 1 times [2023-11-24 21:52:00,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:00,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448694934] [2023-11-24 21:52:00,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:00,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:00,982 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-24 21:52:00,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:00,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448694934] [2023-11-24 21:52:00,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448694934] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:00,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:00,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:52:00,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382520266] [2023-11-24 21:52:00,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:00,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:52:00,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:00,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:52:00,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:52:00,985 INFO L87 Difference]: Start difference. First operand 81 states and 102 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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-24 21:52:01,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:01,114 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2023-11-24 21:52:01,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:52:01,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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 31 [2023-11-24 21:52:01,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:01,115 INFO L225 Difference]: With dead ends: 81 [2023-11-24 21:52:01,115 INFO L226 Difference]: Without dead ends: 81 [2023-11-24 21:52:01,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-24 21:52:01,116 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 44 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:01,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 102 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:52:01,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-24 21:52:01,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-11-24 21:52:01,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 80 states have internal predecessors, (98), 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-24 21:52:01,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2023-11-24 21:52:01,119 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 98 transitions. Word has length 31 [2023-11-24 21:52:01,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:01,119 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 98 transitions. [2023-11-24 21:52:01,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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-24 21:52:01,120 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2023-11-24 21:52:01,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-24 21:52:01,120 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:01,120 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:01,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-24 21:52:01,121 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-24 21:52:01,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:01,121 INFO L85 PathProgramCache]: Analyzing trace with hash 803668087, now seen corresponding path program 2 times [2023-11-24 21:52:01,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:01,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326437388] [2023-11-24 21:52:01,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:01,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-24 21:52:01,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:01,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326437388] [2023-11-24 21:52:01,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326437388] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:52:01,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440361327] [2023-11-24 21:52:01,226 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 21:52:01,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:52:01,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:52:01,227 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:52:01,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-24 21:52:01,419 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 21:52:01,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 21:52:01,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 21:52:01,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:52:01,500 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-24 21:52:01,500 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:52:01,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440361327] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:01,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 21:52:01,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2023-11-24 21:52:01,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845634015] [2023-11-24 21:52:01,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:01,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:52:01,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:01,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:52:01,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:52:01,502 INFO L87 Difference]: Start difference. First operand 81 states and 98 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 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-24 21:52:01,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:01,549 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2023-11-24 21:52:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:52:01,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 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 31 [2023-11-24 21:52:01,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:01,551 INFO L225 Difference]: With dead ends: 73 [2023-11-24 21:52:01,551 INFO L226 Difference]: Without dead ends: 73 [2023-11-24 21:52:01,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:52:01,552 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 54 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:01,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 91 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 21:52:01,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-24 21:52:01,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2023-11-24 21:52:01,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 65 states have internal predecessors, (76), 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-24 21:52:01,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2023-11-24 21:52:01,558 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 31 [2023-11-24 21:52:01,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:01,558 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2023-11-24 21:52:01,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 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-24 21:52:01,559 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2023-11-24 21:52:01,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-24 21:52:01,560 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:01,560 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:01,573 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-24 21:52:01,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:52:01,777 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-24 21:52:01,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:01,777 INFO L85 PathProgramCache]: Analyzing trace with hash -2102421820, now seen corresponding path program 1 times [2023-11-24 21:52:01,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:01,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973263187] [2023-11-24 21:52:01,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:01,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:01,902 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-24 21:52:01,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:01,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973263187] [2023-11-24 21:52:01,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973263187] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:01,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:01,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:52:01,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657461400] [2023-11-24 21:52:01,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:01,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:52:01,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:01,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:52:01,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:52:01,905 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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-24 21:52:01,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:01,946 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2023-11-24 21:52:01,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:52:01,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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 33 [2023-11-24 21:52:01,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:01,948 INFO L225 Difference]: With dead ends: 65 [2023-11-24 21:52:01,948 INFO L226 Difference]: Without dead ends: 65 [2023-11-24 21:52:01,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-24 21:52:01,950 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 9 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:01,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 102 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 21:52:01,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-24 21:52:01,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2023-11-24 21:52:01,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 61 states have internal predecessors, (66), 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-24 21:52:01,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2023-11-24 21:52:01,958 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 33 [2023-11-24 21:52:01,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:01,958 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2023-11-24 21:52:01,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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-24 21:52:01,959 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2023-11-24 21:52:01,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-24 21:52:01,960 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:01,962 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:01,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-24 21:52:01,962 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-24 21:52:01,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:01,963 INFO L85 PathProgramCache]: Analyzing trace with hash -752458600, now seen corresponding path program 1 times [2023-11-24 21:52:01,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:01,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63486480] [2023-11-24 21:52:01,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:01,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:03,454 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:52:03,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:03,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63486480] [2023-11-24 21:52:03,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63486480] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:52:03,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910590253] [2023-11-24 21:52:03,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:03,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:52:03,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:52:03,457 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:52:03,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-24 21:52:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:03,687 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 80 conjunts are in the unsatisfiable core [2023-11-24 21:52:03,690 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:52:03,711 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-24 21:52:03,796 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 21:52:03,796 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-24 21:52:03,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 11 treesize of output 7 [2023-11-24 21:52:03,903 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 19 treesize of output 18 [2023-11-24 21:52:03,990 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-24 21:52:03,992 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 32 treesize of output 31 [2023-11-24 21:52:04,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:52:04,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2023-11-24 21:52:04,251 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-24 21:52:04,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-24 21:52:04,453 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-24 21:52:04,625 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:52:04,625 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:52:04,809 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1316 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1316) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2023-11-24 21:52:04,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:52:04,820 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 27 treesize of output 28 [2023-11-24 21:52:04,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:52:04,831 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 48 treesize of output 51 [2023-11-24 21:52:04,837 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 18 treesize of output 16 [2023-11-24 21:52:05,142 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1312 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1312) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))) is different from false [2023-11-24 21:52:05,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:52:05,152 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 2 case distinctions, treesize of input 28 treesize of output 34 [2023-11-24 21:52:05,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:52:05,158 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 49 treesize of output 31 [2023-11-24 21:52:05,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-24 21:52:05,261 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-24 21:52:05,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910590253] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:52:05,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:52:05,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 48 [2023-11-24 21:52:05,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073412056] [2023-11-24 21:52:05,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:52:05,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-24 21:52:05,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:05,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-24 21:52:05,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1858, Unknown=34, NotChecked=178, Total=2256 [2023-11-24 21:52:05,265 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 48 states, 48 states have (on average 1.9375) internal successors, (93), 48 states have internal predecessors, (93), 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-24 21:52:06,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:06,483 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2023-11-24 21:52:06,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-24 21:52:06,484 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.9375) internal successors, (93), 48 states have internal predecessors, (93), 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-24 21:52:06,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:06,484 INFO L225 Difference]: With dead ends: 69 [2023-11-24 21:52:06,484 INFO L226 Difference]: Without dead ends: 69 [2023-11-24 21:52:06,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=425, Invalid=3089, Unknown=34, NotChecked=234, Total=3782 [2023-11-24 21:52:06,488 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 77 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:06,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 576 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 819 Invalid, 0 Unknown, 133 Unchecked, 0.7s Time] [2023-11-24 21:52:06,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-24 21:52:06,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2023-11-24 21:52:06,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 61 states have internal predecessors, (65), 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-24 21:52:06,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2023-11-24 21:52:06,491 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 34 [2023-11-24 21:52:06,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:06,491 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2023-11-24 21:52:06,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.9375) internal successors, (93), 48 states have internal predecessors, (93), 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-24 21:52:06,492 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2023-11-24 21:52:06,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-24 21:52:06,492 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:06,492 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:06,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-24 21:52:06,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:52:06,699 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-24 21:52:06,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:06,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1234002308, now seen corresponding path program 1 times [2023-11-24 21:52:06,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:06,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537190913] [2023-11-24 21:52:06,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:06,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:08,260 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:52:08,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:08,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537190913] [2023-11-24 21:52:08,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537190913] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:52:08,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433406227] [2023-11-24 21:52:08,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:08,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:52:08,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:52:08,262 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:52:08,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-24 21:52:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:08,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-24 21:52:08,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:52:08,495 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-24 21:52:08,563 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 21:52:08,564 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-24 21:52:08,609 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 11 treesize of output 7 [2023-11-24 21:52:08,653 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 19 treesize of output 18 [2023-11-24 21:52:08,729 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-24 21:52:08,729 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-24 21:52:08,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 21:52:08,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 21:52:08,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:52:08,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2023-11-24 21:52:09,163 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-24 21:52:09,163 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-24 21:52:09,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:52:09,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 16 [2023-11-24 21:52:09,305 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-24 21:52:09,305 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:52:09,396 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1438 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1438) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) 1)) is different from false [2023-11-24 21:52:09,406 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1438 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1438) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) 1)) is different from false [2023-11-24 21:52:09,418 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1438 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_1438) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) 1)) is different from false [2023-11-24 21:52:09,429 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1438 (Array Int Int)) (v_ArrVal_1437 (Array Int Int))) (or (= 1 (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1437))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) v_ArrVal_1438)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1437 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_1437)))) is different from false [2023-11-24 21:52:09,453 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1438 (Array Int Int)) (v_ArrVal_1437 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_45| Int)) (or (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1437) (select v_ArrVal_1437 .cse0) v_ArrVal_1438) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) 1) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_45| (select v_ArrVal_1437 |v_ULTIMATE.start_dll_update_at_~head#1.offset_45|)) v_ArrVal_1437)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_45|))) is different from false [2023-11-24 21:52:09,491 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1438 (Array Int Int)) (v_ArrVal_1437 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_45| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_45|) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1437) (select v_ArrVal_1437 .cse0) v_ArrVal_1438) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0))) 1) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_45| (select v_ArrVal_1437 |v_ULTIMATE.start_dll_update_at_~head#1.offset_45|)) v_ArrVal_1437)))) is different from false [2023-11-24 21:52:09,527 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1438 (Array Int Int)) (v_ArrVal_1437 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_45| Int)) (or (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_45| (select v_ArrVal_1437 |v_ULTIMATE.start_dll_update_at_~head#1.offset_45|)) v_ArrVal_1437)) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1437) (select v_ArrVal_1437 .cse0) v_ArrVal_1438) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) 1) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_45|))) is different from false [2023-11-24 21:52:09,552 INFO L349 Elim1Store]: treesize reduction 5, result has 81.5 percent of original size [2023-11-24 21:52:09,553 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 30 [2023-11-24 21:52:09,572 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1438 (Array Int Int)) (v_ArrVal_1437 (Array Int Int)) (v_ArrVal_1436 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_45| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1436))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_45|) (not (= (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_45| (select v_ArrVal_1437 |v_ULTIMATE.start_dll_update_at_~head#1.offset_45|)) v_ArrVal_1437)) (= (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (select (select (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1437) (select v_ArrVal_1437 .cse1) v_ArrVal_1438) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) is different from false [2023-11-24 21:52:09,612 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1438 (Array Int Int)) (v_ArrVal_1437 (Array Int Int)) (v_ArrVal_1436 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_45| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_45|) (not (= (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1436) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_45| (select v_ArrVal_1437 |v_ULTIMATE.start_dll_update_at_~head#1.offset_45|)) v_ArrVal_1437)) (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1436) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1437) (select v_ArrVal_1437 .cse0) v_ArrVal_1438) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) is different from false [2023-11-24 21:52:09,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:52:09,630 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 2 case distinctions, treesize of input 61 treesize of output 66 [2023-11-24 21:52:09,639 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 51 treesize of output 45 [2023-11-24 21:52:09,650 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 21:52:09,651 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 28 treesize of output 23 [2023-11-24 21:52:09,661 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:52:09,662 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:52:09,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:52:09,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 51 [2023-11-24 21:52:09,689 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 15 treesize of output 11 [2023-11-24 21:52:09,707 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:52:09,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2023-11-24 21:52:09,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:52:09,716 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 17 treesize of output 9 [2023-11-24 21:52:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 11 not checked. [2023-11-24 21:52:09,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433406227] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:52:09,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:52:09,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 16] total 46 [2023-11-24 21:52:09,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530055694] [2023-11-24 21:52:09,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:52:09,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-11-24 21:52:09,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:09,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-11-24 21:52:09,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1278, Unknown=9, NotChecked=720, Total=2162 [2023-11-24 21:52:09,840 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 47 states, 46 states have (on average 2.282608695652174) internal successors, (105), 47 states have internal predecessors, (105), 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-24 21:52:11,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:11,425 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2023-11-24 21:52:11,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-24 21:52:11,428 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.282608695652174) internal successors, (105), 47 states have internal predecessors, (105), 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 37 [2023-11-24 21:52:11,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:11,429 INFO L225 Difference]: With dead ends: 87 [2023-11-24 21:52:11,429 INFO L226 Difference]: Without dead ends: 87 [2023-11-24 21:52:11,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=395, Invalid=2494, Unknown=9, NotChecked=1008, Total=3906 [2023-11-24 21:52:11,433 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 208 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 1700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 800 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:11,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 389 Invalid, 1700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 880 Invalid, 0 Unknown, 800 Unchecked, 0.7s Time] [2023-11-24 21:52:11,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-24 21:52:11,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 65. [2023-11-24 21:52:11,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 64 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-24 21:52:11,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2023-11-24 21:52:11,436 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 37 [2023-11-24 21:52:11,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:11,436 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2023-11-24 21:52:11,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.282608695652174) internal successors, (105), 47 states have internal predecessors, (105), 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-24 21:52:11,437 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2023-11-24 21:52:11,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-24 21:52:11,437 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:11,437 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:11,448 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-24 21:52:11,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:52:11,645 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-24 21:52:11,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:11,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1234002307, now seen corresponding path program 1 times [2023-11-24 21:52:11,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:11,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075801835] [2023-11-24 21:52:11,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:11,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:13,192 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 21:52:13,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:13,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075801835] [2023-11-24 21:52:13,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075801835] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:52:13,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399046466] [2023-11-24 21:52:13,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:13,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:52:13,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:52:13,195 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:52:13,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-24 21:52:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:13,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-24 21:52:13,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:52:13,433 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-24 21:52:13,516 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 21:52:13,516 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-24 21:52:13,562 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 11 treesize of output 7 [2023-11-24 21:52:13,568 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 11 treesize of output 7 [2023-11-24 21:52:13,617 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 23 treesize of output 11 [2023-11-24 21:52:13,624 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 19 treesize of output 18 [2023-11-24 21:52:13,711 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-24 21:52:13,711 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 63 treesize of output 56 [2023-11-24 21:52:13,716 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 39 treesize of output 24 [2023-11-24 21:52:13,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 21:52:13,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 21:52:13,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 33 [2023-11-24 21:52:13,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 21:52:13,998 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 38 treesize of output 22 [2023-11-24 21:52:14,224 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-24 21:52:14,225 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 63 treesize of output 56 [2023-11-24 21:52:14,234 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 39 treesize of output 24 [2023-11-24 21:52:14,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2023-11-24 21:52:14,401 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 26 treesize of output 14 [2023-11-24 21:52:14,443 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-24 21:52:14,444 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:52:14,630 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1566 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1566) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_ArrVal_1567 (Array Int Int)) (v_ArrVal_1566 (Array Int Int))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1566) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1567) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))))) is different from false [2023-11-24 21:52:14,649 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1567 (Array Int Int)) (v_ArrVal_1566 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1566) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1567) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))) (forall ((v_ArrVal_1566 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1566) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2023-11-24 21:52:14,816 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_1564 (Array Int Int))) (or (forall ((v_ArrVal_1566 (Array Int Int)) (v_ArrVal_1565 Int)) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_1565)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1564) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) v_ArrVal_1566) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (not (= (store .cse2 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1564 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_1564)))) (forall ((v_ArrVal_1564 (Array Int Int))) (or (forall ((v_ArrVal_1567 (Array Int Int)) (v_ArrVal_1566 (Array Int Int)) (v_ArrVal_1565 Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1564))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_1565)) .cse3 v_ArrVal_1566) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1567) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) (not (= (store .cse2 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1564 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)) v_ArrVal_1564)))))) is different from false [2023-11-24 21:52:14,883 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int)) (or (forall ((v_ArrVal_1564 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| (select v_ArrVal_1564 |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|)) v_ArrVal_1564)) (forall ((v_ArrVal_1567 (Array Int Int)) (v_ArrVal_1566 (Array Int Int)) (v_ArrVal_1565 Int)) (let ((.cse2 (select v_ArrVal_1564 .cse3))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_1565)) .cse2 v_ArrVal_1566) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1564) .cse2 v_ArrVal_1567) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|))) (forall ((v_ArrVal_1566 (Array Int Int)) (v_DerPreprocessor_8 Int) (v_ArrVal_1565 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_1565)) (select (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_DerPreprocessor_8) .cse3) v_ArrVal_1566) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) 1)))))) is different from false [2023-11-24 21:52:14,920 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (and (forall ((v_ArrVal_1566 (Array Int Int)) (v_DerPreprocessor_8 Int) (v_ArrVal_1565 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int)) (or (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_1565)) (select (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_DerPreprocessor_8) .cse2) v_ArrVal_1566) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2) 1)) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (forall ((v_ArrVal_1564 (Array Int Int))) (or (not (= (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| (select v_ArrVal_1564 |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|)) v_ArrVal_1564)) (forall ((v_ArrVal_1567 (Array Int Int)) (v_ArrVal_1566 (Array Int Int)) (v_ArrVal_1565 Int)) (let ((.cse3 (select v_ArrVal_1564 .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_1565)) .cse3 v_ArrVal_1566) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1564) .cse3 v_ArrVal_1567) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2))))))))))) is different from false [2023-11-24 21:52:15,005 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1566 (Array Int Int)) (v_DerPreprocessor_8 Int) (v_ArrVal_1565 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_1565)) (select (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_DerPreprocessor_8) .cse2) v_ArrVal_1566) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) 1)))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (forall ((v_ArrVal_1564 (Array Int Int))) (or (not (= v_ArrVal_1564 (store .cse1 |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| (select v_ArrVal_1564 |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|)))) (forall ((v_ArrVal_1567 (Array Int Int)) (v_ArrVal_1566 (Array Int Int)) (v_ArrVal_1565 Int)) (let ((.cse3 (select v_ArrVal_1564 .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_1565)) .cse3 v_ArrVal_1566) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1564) .cse3 v_ArrVal_1567) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))))))))))) is different from false [2023-11-24 21:52:15,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:52:15,041 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 124 treesize of output 128 [2023-11-24 21:52:15,171 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_prenex_9 (Array Int Int)) (v_prenex_7 Int) (v_prenex_10 (Array Int Int)) (v_DerPreprocessor_8 Int) (v_prenex_8 Int) (v_prenex_6 (Array Int Int))) (or (< 0 (+ (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_9))) (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_8 v_prenex_7))) (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_8 v_DerPreprocessor_8) .cse1) v_prenex_6) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) 1)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_8))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (forall ((v_ArrVal_1564 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1561))) (or (forall ((v_ArrVal_1567 (Array Int Int))) (= (select (select (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1564) (select v_ArrVal_1564 .cse1) v_ArrVal_1567) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| (select v_ArrVal_1564 |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|)) v_ArrVal_1564))))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (forall ((v_ArrVal_1566 (Array Int Int)) (v_DerPreprocessor_9 Int) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (< (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1562))) (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_1565))) (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1561) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_DerPreprocessor_9) .cse1) v_ArrVal_1566) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 9))))))) is different from false [2023-11-24 21:52:15,291 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 0))) (.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1560 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (forall ((v_ArrVal_1566 (Array Int Int)) (v_DerPreprocessor_9 Int) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (< (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1562) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_1560)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1562) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_1565)) (select (store (select (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1561) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_DerPreprocessor_9) .cse3) v_ArrVal_1566) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 9))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int)) (or (forall ((v_ArrVal_1564 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (or (forall ((v_ArrVal_1567 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1561) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1564) (select v_ArrVal_1564 .cse3) v_ArrVal_1567) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= (store (select (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1561) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| (select v_ArrVal_1564 |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|)) v_ArrVal_1564)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_7 Int) (v_prenex_10 (Array Int Int)) (v_ArrVal_1560 Int) (v_DerPreprocessor_8 Int) (v_prenex_8 Int) (v_prenex_6 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_9) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_1560)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_9) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_8 v_prenex_7)) (select (store (select (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_8 v_DerPreprocessor_8) .cse3) v_prenex_6) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3) 1)) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_8)))))) is different from false [2023-11-24 21:52:15,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:52:15,321 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 2 case distinctions, treesize of input 105 treesize of output 110 [2023-11-24 21:52:15,335 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 75 treesize of output 71 [2023-11-24 21:52:15,341 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:52:15,343 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 68 treesize of output 60 [2023-11-24 21:52:15,348 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:52:15,351 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 52 treesize of output 48 [2023-11-24 21:52:15,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:52:15,361 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 2 case distinctions, treesize of input 87 treesize of output 77 [2023-11-24 21:52:15,365 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 111 treesize of output 103 [2023-11-24 21:52:15,371 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:52:15,373 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 81 treesize of output 73 [2023-11-24 21:52:15,377 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:52:15,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 67 [2023-11-24 21:52:15,386 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 14 treesize of output 10 [2023-11-24 21:52:15,394 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:52:15,401 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-24 21:52:15,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 1 [2023-11-24 21:52:15,404 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:52:15,410 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-24 21:52:15,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 1 [2023-11-24 21:52:15,611 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 10 not checked. [2023-11-24 21:52:15,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399046466] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:52:15,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:52:15,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 16] total 43 [2023-11-24 21:52:15,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115786133] [2023-11-24 21:52:15,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:52:15,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-24 21:52:15,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:15,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-24 21:52:15,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1131, Unknown=28, NotChecked=600, Total=1892 [2023-11-24 21:52:15,617 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 44 states, 43 states have (on average 2.5348837209302326) internal successors, (109), 44 states have internal predecessors, (109), 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-24 21:52:18,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:18,017 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2023-11-24 21:52:18,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-24 21:52:18,018 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.5348837209302326) internal successors, (109), 44 states have internal predecessors, (109), 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 37 [2023-11-24 21:52:18,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:18,019 INFO L225 Difference]: With dead ends: 72 [2023-11-24 21:52:18,019 INFO L226 Difference]: Without dead ends: 72 [2023-11-24 21:52:18,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=336, Invalid=2115, Unknown=31, NotChecked=824, Total=3306 [2023-11-24 21:52:18,021 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 96 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 550 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:18,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 540 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 807 Invalid, 0 Unknown, 550 Unchecked, 0.7s Time] [2023-11-24 21:52:18,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-24 21:52:18,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2023-11-24 21:52:18,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 63 states have internal predecessors, (68), 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-24 21:52:18,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2023-11-24 21:52:18,023 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 37 [2023-11-24 21:52:18,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:18,024 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2023-11-24 21:52:18,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.5348837209302326) internal successors, (109), 44 states have internal predecessors, (109), 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-24 21:52:18,024 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2023-11-24 21:52:18,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-24 21:52:18,024 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:18,025 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:18,036 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-24 21:52:18,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:52:18,225 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-24 21:52:18,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:18,226 INFO L85 PathProgramCache]: Analyzing trace with hash 398742496, now seen corresponding path program 1 times [2023-11-24 21:52:18,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:18,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000755378] [2023-11-24 21:52:18,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:18,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:18,328 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-24 21:52:18,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:18,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000755378] [2023-11-24 21:52:18,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000755378] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:52:18,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895047880] [2023-11-24 21:52:18,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:18,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:52:18,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:52:18,330 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:52:18,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-24 21:52:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:18,578 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 21:52:18,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:52:18,596 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-24 21:52:18,596 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:52:18,617 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-24 21:52:18,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895047880] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:52:18,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:52:18,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2023-11-24 21:52:18,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496689097] [2023-11-24 21:52:18,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:52:18,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:52:18,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:18,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:52:18,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:52:18,620 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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-24 21:52:18,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:18,680 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2023-11-24 21:52:18,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:52:18,681 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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 38 [2023-11-24 21:52:18,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:18,681 INFO L225 Difference]: With dead ends: 64 [2023-11-24 21:52:18,681 INFO L226 Difference]: Without dead ends: 64 [2023-11-24 21:52:18,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:52:18,682 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 68 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:18,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 110 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:52:18,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-24 21:52:18,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-11-24 21:52:18,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 63 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-24 21:52:18,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2023-11-24 21:52:18,685 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 38 [2023-11-24 21:52:18,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:18,686 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2023-11-24 21:52:18,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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-24 21:52:18,686 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2023-11-24 21:52:18,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-24 21:52:18,687 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:18,687 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:18,693 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-24 21:52:18,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:52:18,893 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-24 21:52:18,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:18,894 INFO L85 PathProgramCache]: Analyzing trace with hash -465120059, now seen corresponding path program 2 times [2023-11-24 21:52:18,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:18,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409817454] [2023-11-24 21:52:18,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:18,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:19,013 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-24 21:52:19,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:19,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409817454] [2023-11-24 21:52:19,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409817454] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:52:19,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6707902] [2023-11-24 21:52:19,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 21:52:19,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:52:19,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:52:19,016 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:52:19,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-24 21:52:19,256 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 21:52:19,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 21:52:19,259 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-24 21:52:19,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:52:19,314 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-24 21:52:19,314 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:52:19,377 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-24 21:52:19,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6707902] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:52:19,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:52:19,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 7 [2023-11-24 21:52:19,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868184981] [2023-11-24 21:52:19,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:52:19,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:52:19,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:19,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:52:19,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:52:19,380 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-24 21:52:19,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:19,468 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2023-11-24 21:52:19,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:52:19,469 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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 39 [2023-11-24 21:52:19,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:19,469 INFO L225 Difference]: With dead ends: 56 [2023-11-24 21:52:19,470 INFO L226 Difference]: Without dead ends: 56 [2023-11-24 21:52:19,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2023-11-24 21:52:19,471 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 36 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:19,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 134 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-24 21:52:19,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-24 21:52:19,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-11-24 21:52:19,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.163265306122449) internal successors, (57), 55 states have internal predecessors, (57), 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-24 21:52:19,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2023-11-24 21:52:19,473 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 39 [2023-11-24 21:52:19,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:19,474 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2023-11-24 21:52:19,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-24 21:52:19,475 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2023-11-24 21:52:19,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-24 21:52:19,475 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:19,475 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:19,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-24 21:52:19,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:52:19,676 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-24 21:52:19,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:19,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1535711561, now seen corresponding path program 1 times [2023-11-24 21:52:19,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:19,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801457922] [2023-11-24 21:52:19,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:19,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:20,961 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:52:20,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:20,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801457922] [2023-11-24 21:52:20,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801457922] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:52:20,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257437919] [2023-11-24 21:52:20,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:20,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:52:20,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:52:20,964 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:52:20,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-24 21:52:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:21,213 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 92 conjunts are in the unsatisfiable core [2023-11-24 21:52:21,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:52:21,243 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-24 21:52:21,349 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 21:52:21,349 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-24 21:52:21,399 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 11 treesize of output 7 [2023-11-24 21:52:21,444 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 19 treesize of output 18 [2023-11-24 21:52:21,532 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-24 21:52:21,532 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 32 treesize of output 31 [2023-11-24 21:52:21,774 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 8 treesize of output 1 [2023-11-24 21:52:21,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 21:52:21,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 21:52:21,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:52:21,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2023-11-24 21:52:22,054 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-24 21:52:22,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 71 treesize of output 62 [2023-11-24 21:52:22,062 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 23 treesize of output 15 [2023-11-24 21:52:22,066 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 32 treesize of output 19 [2023-11-24 21:52:22,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2023-11-24 21:52:22,398 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 19 treesize of output 11 [2023-11-24 21:52:22,473 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:52:22,473 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 21:52:22,665 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 86 treesize of output 64 [2023-11-24 21:52:22,675 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1923 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1923) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (= |c_ULTIMATE.start_dll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (forall ((v_ArrVal_1925 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1925) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) is different from false [2023-11-24 21:52:22,836 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1923 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1923) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (forall ((v_ArrVal_1925 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1925) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2023-11-24 21:52:22,847 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 251 treesize of output 227 [2023-11-24 21:52:22,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 93 treesize of output 85 [2023-11-24 21:52:22,862 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 85 treesize of output 81 [2023-11-24 21:52:22,898 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1922 (Array Int Int))) (or (not (= v_ArrVal_1922 (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1922 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1922) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_1922 (Array Int Int))) (or (not (= v_ArrVal_1922 (store .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.offset| (select v_ArrVal_1922 |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_1923 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1922))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= (select (select (store .cse2 .cse3 v_ArrVal_1923) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) .cse3)))))))) is different from false [2023-11-24 21:52:22,954 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_58| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|) (forall ((v_ArrVal_1922 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| (select v_ArrVal_1922 |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|)) v_ArrVal_1922)) (forall ((v_ArrVal_1923 (Array Int Int))) (let ((.cse1 (select v_ArrVal_1922 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1922) .cse1 v_ArrVal_1923) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1))))))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_DerPreprocessor_11 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_58| Int)) (or (not (= (select (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| v_DerPreprocessor_11) .cse2) |c_ULTIMATE.start_main_~s~0#1.base|)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|))))) is different from false [2023-11-24 21:52:22,988 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_58| Int)) (or (forall ((v_ArrVal_1922 (Array Int Int))) (or (forall ((v_ArrVal_1923 (Array Int Int))) (let ((.cse0 (select v_ArrVal_1922 .cse1))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1922) .cse0 v_ArrVal_1923) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1)))) (not (= (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| (select v_ArrVal_1922 |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|)) v_ArrVal_1922)))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|))) (forall ((v_DerPreprocessor_11 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_58| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| v_DerPreprocessor_11) .cse1))))))) is different from false [2023-11-24 21:52:23,034 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_58| Int)) (or (forall ((v_ArrVal_1922 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| (select v_ArrVal_1922 |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|)) v_ArrVal_1922)) (forall ((v_ArrVal_1923 (Array Int Int))) (let ((.cse1 (select v_ArrVal_1922 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1922) .cse1 v_ArrVal_1923) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) .cse1))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|))) (forall ((v_DerPreprocessor_11 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_58| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store .cse0 |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| v_DerPreprocessor_11) .cse2))))))) is different from false [2023-11-24 21:52:23,063 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_DerPreprocessor_11 Int) (v_ArrVal_1920 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_58| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1920) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| v_DerPreprocessor_11) .cse0))))) (forall ((v_ArrVal_1920 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_58| Int)) (or (forall ((v_ArrVal_1922 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1920))) (or (not (= v_ArrVal_1922 (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_58| (select v_ArrVal_1922 |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|)))) (forall ((v_ArrVal_1923 (Array Int Int))) (let ((.cse2 (select v_ArrVal_1922 .cse0))) (= (select (select (store (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1922) .cse2 v_ArrVal_1923) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) .cse2)))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_58|))))) is different from false [2023-11-24 21:52:23,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:52:23,286 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 2 case distinctions, treesize of input 57 treesize of output 62 [2023-11-24 21:52:23,294 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 51 treesize of output 45 [2023-11-24 21:52:23,302 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:52:23,302 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:52:23,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:52:23,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 56 [2023-11-24 21:52:23,329 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 21:52:23,329 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 23 treesize of output 18 [2023-11-24 21:52:23,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 21:52:23,359 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 21:52:23,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2023-11-24 21:52:23,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:52:23,367 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 17 treesize of output 9 [2023-11-24 21:52:23,374 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-24 21:52:23,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 1 [2023-11-24 21:52:23,518 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2023-11-24 21:52:23,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257437919] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 21:52:23,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 21:52:23,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 55 [2023-11-24 21:52:23,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043797670] [2023-11-24 21:52:23,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 21:52:23,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-11-24 21:52:23,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:23,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-11-24 21:52:23,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2065, Unknown=24, NotChecked=686, Total=2970 [2023-11-24 21:52:23,522 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand has 55 states, 55 states have (on average 2.036363636363636) internal successors, (112), 55 states have internal predecessors, (112), 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-24 21:52:24,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:24,965 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2023-11-24 21:52:24,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-24 21:52:24,965 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.036363636363636) internal successors, (112), 55 states have internal predecessors, (112), 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 40 [2023-11-24 21:52:24,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:24,966 INFO L225 Difference]: With dead ends: 60 [2023-11-24 21:52:24,966 INFO L226 Difference]: Without dead ends: 60 [2023-11-24 21:52:24,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=415, Invalid=3371, Unknown=24, NotChecked=882, Total=4692 [2023-11-24 21:52:24,969 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 66 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 412 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:24,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 505 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 924 Invalid, 0 Unknown, 412 Unchecked, 0.6s Time] [2023-11-24 21:52:24,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-24 21:52:24,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2023-11-24 21:52:24,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.148936170212766) internal successors, (54), 52 states have internal predecessors, (54), 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-24 21:52:24,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2023-11-24 21:52:24,971 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 40 [2023-11-24 21:52:24,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:24,972 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2023-11-24 21:52:24,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.036363636363636) internal successors, (112), 55 states have internal predecessors, (112), 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-24 21:52:24,972 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2023-11-24 21:52:24,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-24 21:52:24,973 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:24,973 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:24,983 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-24 21:52:25,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-24 21:52:25,183 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-24 21:52:25,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:25,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1644283671, now seen corresponding path program 1 times [2023-11-24 21:52:25,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:25,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602579231] [2023-11-24 21:52:25,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:25,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:25,301 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-24 21:52:25,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:25,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602579231] [2023-11-24 21:52:25,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602579231] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:52:25,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709755358] [2023-11-24 21:52:25,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:25,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:52:25,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:52:25,304 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:52:25,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-24 21:52:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:25,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-24 21:52:25,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:52:25,569 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-24 21:52:25,623 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-24 21:52:25,624 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:52:25,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709755358] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:25,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-24 21:52:25,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 6 [2023-11-24 21:52:25,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084285268] [2023-11-24 21:52:25,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:25,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:52:25,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:25,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:52:25,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:52:25,626 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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-24 21:52:25,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:25,743 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2023-11-24 21:52:25,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:52:25,743 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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 42 [2023-11-24 21:52:25,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:25,744 INFO L225 Difference]: With dead ends: 63 [2023-11-24 21:52:25,744 INFO L226 Difference]: Without dead ends: 63 [2023-11-24 21:52:25,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:52:25,745 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 29 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:25,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 52 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:52:25,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-24 21:52:25,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2023-11-24 21:52:25,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.163265306122449) internal successors, (57), 53 states have internal predecessors, (57), 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-24 21:52:25,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2023-11-24 21:52:25,747 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 42 [2023-11-24 21:52:25,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:25,748 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2023-11-24 21:52:25,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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-24 21:52:25,748 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2023-11-24 21:52:25,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-24 21:52:25,748 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:25,748 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:25,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-24 21:52:25,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:52:25,949 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-24 21:52:25,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:25,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1644283672, now seen corresponding path program 1 times [2023-11-24 21:52:25,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:25,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769543198] [2023-11-24 21:52:25,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:25,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:26,201 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-24 21:52:26,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:26,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769543198] [2023-11-24 21:52:26,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769543198] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:26,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:26,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:52:26,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319139839] [2023-11-24 21:52:26,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:26,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:52:26,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:26,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:52:26,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:52:26,204 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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-24 21:52:26,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:26,339 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2023-11-24 21:52:26,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:52:26,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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 42 [2023-11-24 21:52:26,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:26,340 INFO L225 Difference]: With dead ends: 59 [2023-11-24 21:52:26,340 INFO L226 Difference]: Without dead ends: 59 [2023-11-24 21:52:26,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-24 21:52:26,341 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:26,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 49 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:52:26,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-24 21:52:26,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2023-11-24 21:52:26,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.14) internal successors, (57), 54 states have internal predecessors, (57), 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-24 21:52:26,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2023-11-24 21:52:26,343 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 42 [2023-11-24 21:52:26,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:26,343 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2023-11-24 21:52:26,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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-24 21:52:26,344 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2023-11-24 21:52:26,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-24 21:52:26,344 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:26,344 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:26,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-24 21:52:26,344 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-24 21:52:26,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:26,345 INFO L85 PathProgramCache]: Analyzing trace with hash -566815141, now seen corresponding path program 1 times [2023-11-24 21:52:26,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:26,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595899615] [2023-11-24 21:52:26,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:26,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:26,450 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-24 21:52:26,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:26,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595899615] [2023-11-24 21:52:26,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595899615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:26,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:26,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:52:26,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266708632] [2023-11-24 21:52:26,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:26,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:52:26,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:26,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:52:26,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:52:26,455 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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-24 21:52:26,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:26,555 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2023-11-24 21:52:26,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:52:26,556 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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 43 [2023-11-24 21:52:26,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:26,556 INFO L225 Difference]: With dead ends: 58 [2023-11-24 21:52:26,556 INFO L226 Difference]: Without dead ends: 58 [2023-11-24 21:52:26,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-24 21:52:26,557 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:26,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 66 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:52:26,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-11-24 21:52:26,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2023-11-24 21:52:26,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.12) internal successors, (56), 54 states have internal predecessors, (56), 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-24 21:52:26,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2023-11-24 21:52:26,559 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 43 [2023-11-24 21:52:26,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:26,559 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2023-11-24 21:52:26,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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-24 21:52:26,560 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2023-11-24 21:52:26,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-24 21:52:26,560 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:26,560 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:26,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-24 21:52:26,560 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-24 21:52:26,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:26,561 INFO L85 PathProgramCache]: Analyzing trace with hash -391323818, now seen corresponding path program 1 times [2023-11-24 21:52:26,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:26,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221274337] [2023-11-24 21:52:26,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:26,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:26,709 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-24 21:52:26,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:26,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221274337] [2023-11-24 21:52:26,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221274337] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:52:26,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:52:26,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:52:26,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291987235] [2023-11-24 21:52:26,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:52:26,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:52:26,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:52:26,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:52:26,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:52:26,712 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 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-24 21:52:26,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 21:52:26,805 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2023-11-24 21:52:26,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:52:26,805 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 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 44 [2023-11-24 21:52:26,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 21:52:26,806 INFO L225 Difference]: With dead ends: 56 [2023-11-24 21:52:26,806 INFO L226 Difference]: Without dead ends: 56 [2023-11-24 21:52:26,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-24 21:52:26,807 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 21:52:26,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 56 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 21:52:26,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-24 21:52:26,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-11-24 21:52:26,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 55 states have internal predecessors, (57), 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-24 21:52:26,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2023-11-24 21:52:26,809 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 44 [2023-11-24 21:52:26,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 21:52:26,809 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2023-11-24 21:52:26,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 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-24 21:52:26,809 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2023-11-24 21:52:26,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-24 21:52:26,810 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 21:52:26,810 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:52:26,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-24 21:52:26,810 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-11-24 21:52:26,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:52:26,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1386449222, now seen corresponding path program 1 times [2023-11-24 21:52:26,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:52:26,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707999826] [2023-11-24 21:52:26,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:26,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:52:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:27,990 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-24 21:52:27,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:52:27,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707999826] [2023-11-24 21:52:27,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707999826] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 21:52:27,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876498646] [2023-11-24 21:52:27,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:52:27,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 21:52:27,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:52:27,993 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 21:52:27,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3ba3d4f-adf6-41a6-9a04-f2bfff62108a/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-24 21:52:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:52:28,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-24 21:52:28,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:52:28,261 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-24 21:52:28,293 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 21:52:28,294 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-24 21:52:28,324 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 11 treesize of output 7 [2023-11-24 21:52:28,361 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 19 treesize of output 18 [2023-11-24 21:52:28,418 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-24 21:52:28,418 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 32 treesize of output 31 [2023-11-24 21:52:28,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 21:52:28,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 21:52:28,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 21:52:28,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2023-11-24 21:52:28,689 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-24 21:52:28,690 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