./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_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme --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-26 11:43:43,537 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:43:43,679 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-26 11:43:43,683 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:43:43,684 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:43:43,723 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:43:43,725 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:43:43,726 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:43:43,727 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:43:43,733 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:43:43,734 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:43:43,734 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:43:43,735 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:43:43,737 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:43:43,738 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:43:43,738 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:43:43,739 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:43:43,739 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:43:43,740 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:43:43,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:43:43,741 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 11:43:43,742 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 11:43:43,742 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 11:43:43,743 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:43:43,743 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 11:43:43,744 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:43:43,744 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:43:43,745 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:43:43,746 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:43:43,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:43:43,748 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:43:43,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:43:43,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:43:43,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:43:43,749 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:43:43,750 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:43:43,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:43:43,750 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:43:43,751 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:43:43,751 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:43:43,751 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:43:43,752 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_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/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_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme 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-26 11:43:44,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:43:44,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:43:44,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:43:44,141 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:43:44,141 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:43:44,143 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/list-simple/dll2n_update_all.i [2023-11-26 11:43:47,286 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:43:47,585 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:43:47,586 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/sv-benchmarks/c/list-simple/dll2n_update_all.i [2023-11-26 11:43:47,603 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/data/bc6f7604b/ab1fdf78e5fd49748f9784508773d0c7/FLAGc6923460e [2023-11-26 11:43:47,618 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/data/bc6f7604b/ab1fdf78e5fd49748f9784508773d0c7 [2023-11-26 11:43:47,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:43:47,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:43:47,624 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:43:47,624 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:43:47,629 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:43:47,630 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:43:47" (1/1) ... [2023-11-26 11:43:47,631 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b768c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:47, skipping insertion in model container [2023-11-26 11:43:47,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:43:47" (1/1) ... [2023-11-26 11:43:47,686 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:43:48,102 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:43:48,116 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:43:48,199 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:43:48,238 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:43:48,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:48 WrapperNode [2023-11-26 11:43:48,239 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:43:48,240 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:43:48,240 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:43:48,240 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:43:48,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:48" (1/1) ... [2023-11-26 11:43:48,266 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:48" (1/1) ... [2023-11-26 11:43:48,301 INFO L138 Inliner]: procedures = 126, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 120 [2023-11-26 11:43:48,301 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:43:48,302 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:43:48,302 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:43:48,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:43:48,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:48" (1/1) ... [2023-11-26 11:43:48,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:48" (1/1) ... [2023-11-26 11:43:48,321 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:48" (1/1) ... [2023-11-26 11:43:48,371 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-26 11:43:48,372 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:48" (1/1) ... [2023-11-26 11:43:48,372 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:48" (1/1) ... [2023-11-26 11:43:48,382 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:48" (1/1) ... [2023-11-26 11:43:48,387 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:48" (1/1) ... [2023-11-26 11:43:48,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:48" (1/1) ... [2023-11-26 11:43:48,393 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:48" (1/1) ... [2023-11-26 11:43:48,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:43:48,398 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:43:48,399 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:43:48,399 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:43:48,400 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:48" (1/1) ... [2023-11-26 11:43:48,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:43:48,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:43:48,454 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:43:48,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:43:48,503 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-26 11:43:48,504 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-26 11:43:48,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-26 11:43:48,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-26 11:43:48,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 11:43:48,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 11:43:48,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-26 11:43:48,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:43:48,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-26 11:43:48,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-26 11:43:48,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-26 11:43:48,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-26 11:43:48,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:43:48,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:43:48,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 11:43:48,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:43:48,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:43:48,721 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:43:48,724 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:43:48,768 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-26 11:43:49,050 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:43:49,135 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:43:49,137 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-26 11:43:49,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:43:49 BoogieIcfgContainer [2023-11-26 11:43:49,138 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:43:49,142 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:43:49,142 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:43:49,146 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:43:49,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:43:47" (1/3) ... [2023-11-26 11:43:49,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@217db1cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:43:49, skipping insertion in model container [2023-11-26 11:43:49,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:48" (2/3) ... [2023-11-26 11:43:49,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@217db1cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:43:49, skipping insertion in model container [2023-11-26 11:43:49,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:43:49" (3/3) ... [2023-11-26 11:43:49,153 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.i [2023-11-26 11:43:49,175 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:43:49,176 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2023-11-26 11:43:49,240 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:43:49,249 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;@2b905b85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:43:49,250 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-11-26 11:43:49,255 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-26 11:43:49,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-26 11:43:49,265 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:43:49,266 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-26 11:43:49,267 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-26 11:43:49,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:43:49,276 INFO L85 PathProgramCache]: Analyzing trace with hash 6033865, now seen corresponding path program 1 times [2023-11-26 11:43:49,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:43:49,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277080593] [2023-11-26 11:43:49,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:49,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:43:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,618 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-26 11:43:49,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:43:49,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277080593] [2023-11-26 11:43:49,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277080593] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:43:49,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:43:49,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:43:49,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073787820] [2023-11-26 11:43:49,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:43:49,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:43:49,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:43:49,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:43:49,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:43:49,689 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-26 11:43:49,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:43:49,808 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2023-11-26 11:43:49,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:43:49,810 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-26 11:43:49,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:43:49,819 INFO L225 Difference]: With dead ends: 54 [2023-11-26 11:43:49,819 INFO L226 Difference]: Without dead ends: 50 [2023-11-26 11:43:49,821 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-26 11:43:49,826 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.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:43:49,828 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.1s Time] [2023-11-26 11:43:49,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-26 11:43:49,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-11-26 11:43:49,863 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-26 11:43:49,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2023-11-26 11:43:49,866 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 4 [2023-11-26 11:43:49,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:43:49,867 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2023-11-26 11:43:49,867 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-26 11:43:49,867 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2023-11-26 11:43:49,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-26 11:43:49,868 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:43:49,868 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-26 11:43:49,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:43:49,869 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-26 11:43:49,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:43:49,870 INFO L85 PathProgramCache]: Analyzing trace with hash 6033866, now seen corresponding path program 1 times [2023-11-26 11:43:49,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:43:49,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167408414] [2023-11-26 11:43:49,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:49,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:43:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,977 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-26 11:43:49,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:43:49,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167408414] [2023-11-26 11:43:49,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167408414] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:43:49,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:43:49,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:43:49,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712147226] [2023-11-26 11:43:49,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:43:49,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:43:49,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:43:49,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:43:49,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:43:49,982 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-26 11:43:50,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:43:50,057 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2023-11-26 11:43:50,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:43:50,058 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-26 11:43:50,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:43:50,059 INFO L225 Difference]: With dead ends: 47 [2023-11-26 11:43:50,060 INFO L226 Difference]: Without dead ends: 47 [2023-11-26 11:43:50,060 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-26 11:43:50,062 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:43:50,063 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.1s Time] [2023-11-26 11:43:50,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-26 11:43:50,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-11-26 11:43:50,069 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-26 11:43:50,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2023-11-26 11:43:50,071 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 4 [2023-11-26 11:43:50,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:43:50,072 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2023-11-26 11:43:50,072 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-26 11:43:50,073 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2023-11-26 11:43:50,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-26 11:43:50,073 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:43:50,074 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-26 11:43:50,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:43:50,074 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-26 11:43:50,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:43:50,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1506349614, now seen corresponding path program 1 times [2023-11-26 11:43:50,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:43:50,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907260229] [2023-11-26 11:43:50,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:50,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:43:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:50,152 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-26 11:43:50,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:43:50,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907260229] [2023-11-26 11:43:50,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907260229] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:43:50,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:43:50,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:43:50,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510155452] [2023-11-26 11:43:50,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:43:50,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:43:50,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:43:50,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:43:50,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:43:50,156 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-26 11:43:50,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:43:50,222 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2023-11-26 11:43:50,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:43:50,223 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-26 11:43:50,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:43:50,224 INFO L225 Difference]: With dead ends: 57 [2023-11-26 11:43:50,224 INFO L226 Difference]: Without dead ends: 57 [2023-11-26 11:43:50,225 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-26 11:43:50,226 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 10 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:43:50,227 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.1s Time] [2023-11-26 11:43:50,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-26 11:43:50,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2023-11-26 11:43:50,251 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-26 11:43:50,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2023-11-26 11:43:50,253 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 6 [2023-11-26 11:43:50,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:43:50,253 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2023-11-26 11:43:50,253 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-26 11:43:50,254 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2023-11-26 11:43:50,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-26 11:43:50,254 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:43:50,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:43:50,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:43:50,255 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-26 11:43:50,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:43:50,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1828366541, now seen corresponding path program 1 times [2023-11-26 11:43:50,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:43:50,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119935575] [2023-11-26 11:43:50,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:50,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:43:50,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:50,415 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-26 11:43:50,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:43:50,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119935575] [2023-11-26 11:43:50,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119935575] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:43:50,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:43:50,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:43:50,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412356939] [2023-11-26 11:43:50,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:43:50,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:43:50,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:43:50,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:43:50,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:43:50,418 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-26 11:43:50,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:43:50,473 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2023-11-26 11:43:50,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:43:50,473 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-26 11:43:50,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:43:50,474 INFO L225 Difference]: With dead ends: 54 [2023-11-26 11:43:50,475 INFO L226 Difference]: Without dead ends: 54 [2023-11-26 11:43:50,475 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-26 11:43:50,477 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-26 11:43:50,477 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-26 11:43:50,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-26 11:43:50,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2023-11-26 11:43:50,483 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-26 11:43:50,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2023-11-26 11:43:50,485 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 8 [2023-11-26 11:43:50,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:43:50,485 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2023-11-26 11:43:50,485 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-26 11:43:50,486 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2023-11-26 11:43:50,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-26 11:43:50,486 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:43:50,487 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:43:50,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:43:50,487 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-26 11:43:50,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:43:50,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1117956245, now seen corresponding path program 1 times [2023-11-26 11:43:50,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:43:50,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755621927] [2023-11-26 11:43:50,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:50,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:43:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:50,609 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-26 11:43:50,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:43:50,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755621927] [2023-11-26 11:43:50,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755621927] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:43:50,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:43:50,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:43:50,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908836956] [2023-11-26 11:43:50,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:43:50,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:43:50,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:43:50,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:43:50,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:43:50,613 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-26 11:43:50,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:43:50,680 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2023-11-26 11:43:50,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:43:50,681 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-26 11:43:50,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:43:50,683 INFO L225 Difference]: With dead ends: 85 [2023-11-26 11:43:50,683 INFO L226 Difference]: Without dead ends: 85 [2023-11-26 11:43:50,683 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-26 11:43:50,685 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-26 11:43:50,686 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-26 11:43:50,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-26 11:43:50,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 55. [2023-11-26 11:43:50,692 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-26 11:43:50,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2023-11-26 11:43:50,694 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 13 [2023-11-26 11:43:50,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:43:50,695 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2023-11-26 11:43:50,695 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-26 11:43:50,695 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2023-11-26 11:43:50,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-26 11:43:50,696 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:43:50,697 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:43:50,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:43:50,697 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-26 11:43:50,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:43:50,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1117956300, now seen corresponding path program 1 times [2023-11-26 11:43:50,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:43:50,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356718114] [2023-11-26 11:43:50,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:50,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:43:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:50,861 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-26 11:43:50,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:43:50,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356718114] [2023-11-26 11:43:50,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356718114] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:43:50,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:43:50,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:43:50,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504273823] [2023-11-26 11:43:50,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:43:50,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:43:50,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:43:50,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:43:50,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:43:50,865 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-26 11:43:51,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:43:51,081 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2023-11-26 11:43:51,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:43:51,082 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-26 11:43:51,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:43:51,091 INFO L225 Difference]: With dead ends: 73 [2023-11-26 11:43:51,091 INFO L226 Difference]: Without dead ends: 73 [2023-11-26 11:43:51,091 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-26 11:43:51,094 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.2s IncrementalHoareTripleChecker+Time [2023-11-26 11:43:51,096 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.2s Time] [2023-11-26 11:43:51,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-26 11:43:51,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2023-11-26 11:43:51,112 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-26 11:43:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2023-11-26 11:43:51,117 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 13 [2023-11-26 11:43:51,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:43:51,117 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2023-11-26 11:43:51,118 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-26 11:43:51,118 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2023-11-26 11:43:51,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-26 11:43:51,119 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:43:51,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:43:51,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:43:51,120 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-26 11:43:51,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:43:51,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1117956299, now seen corresponding path program 1 times [2023-11-26 11:43:51,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:43:51,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649615199] [2023-11-26 11:43:51,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:51,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:43:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:51,271 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-26 11:43:51,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:43:51,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649615199] [2023-11-26 11:43:51,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649615199] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:43:51,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562779610] [2023-11-26 11:43:51,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:51,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:43:51,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:43:51,276 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:43:51,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 11:43:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:51,390 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-26 11:43:51,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:43:51,462 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-26 11:43:51,463 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:43:51,491 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-26 11:43:51,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562779610] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:43:51,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:43:51,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-11-26 11:43:51,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007593461] [2023-11-26 11:43:51,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:43:51,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:43:51,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:43:51,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:43:51,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:43:51,494 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-26 11:43:51,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:43:51,526 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2023-11-26 11:43:51,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:43:51,527 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-26 11:43:51,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:43:51,528 INFO L225 Difference]: With dead ends: 59 [2023-11-26 11:43:51,528 INFO L226 Difference]: Without dead ends: 59 [2023-11-26 11:43:51,528 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-26 11:43:51,529 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-26 11:43:51,530 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-26 11:43:51,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-26 11:43:51,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-11-26 11:43:51,534 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-26 11:43:51,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2023-11-26 11:43:51,535 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 13 [2023-11-26 11:43:51,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:43:51,536 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2023-11-26 11:43:51,536 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-26 11:43:51,536 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2023-11-26 11:43:51,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-26 11:43:51,537 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:43:51,537 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-11-26 11:43:51,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-26 11:43:51,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-26 11:43:51,744 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-26 11:43:51,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:43:51,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1016238795, now seen corresponding path program 1 times [2023-11-26 11:43:51,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:43:51,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325105642] [2023-11-26 11:43:51,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:51,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:43:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:52,133 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-26 11:43:52,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:43:52,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325105642] [2023-11-26 11:43:52,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325105642] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:43:52,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857101578] [2023-11-26 11:43:52,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:52,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:43:52,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:43:52,135 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:43:52,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-26 11:43:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:52,281 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-26 11:43:52,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:43:52,326 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-26 11:43:52,332 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-26 11:43:52,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:43:52,427 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-26 11:43:52,441 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-26 11:43:52,441 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-26 11:43:52,482 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-26 11:43:52,483 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:43:52,779 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-26 11:43:52,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857101578] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:43:52,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:43:52,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2023-11-26 11:43:52,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248831562] [2023-11-26 11:43:52,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:43:52,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-26 11:43:52,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:43:52,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-26 11:43:52,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-11-26 11:43:52,783 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-26 11:43:53,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:43:53,010 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2023-11-26 11:43:53,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:43:53,011 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-26 11:43:53,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:43:53,012 INFO L225 Difference]: With dead ends: 58 [2023-11-26 11:43:53,012 INFO L226 Difference]: Without dead ends: 58 [2023-11-26 11:43:53,012 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-26 11:43:53,013 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-26 11:43:53,013 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-26 11:43:53,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-11-26 11:43:53,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-11-26 11:43:53,017 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-26 11:43:53,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2023-11-26 11:43:53,018 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 15 [2023-11-26 11:43:53,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:43:53,018 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2023-11-26 11:43:53,019 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-26 11:43:53,019 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2023-11-26 11:43:53,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-26 11:43:53,020 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:43:53,020 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-26 11:43:53,030 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-26 11:43:53,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:43:53,226 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-26 11:43:53,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:43:53,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1560879960, now seen corresponding path program 2 times [2023-11-26 11:43:53,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:43:53,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752065189] [2023-11-26 11:43:53,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:53,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:43:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:53,313 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-26 11:43:53,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:43:53,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752065189] [2023-11-26 11:43:53,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752065189] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:43:53,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343348910] [2023-11-26 11:43:53,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-26 11:43:53,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:43:53,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:43:53,315 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:43:53,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-26 11:43:53,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-26 11:43:53,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 11:43:53,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-26 11:43:53,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:43:53,495 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-26 11:43:53,495 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:43:53,523 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-26 11:43:53,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343348910] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:43:53,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:43:53,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2023-11-26 11:43:53,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957113701] [2023-11-26 11:43:53,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:43:53,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:43:53,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:43:53,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:43:53,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:43:53,526 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-26 11:43:53,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:43:53,590 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2023-11-26 11:43:53,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:43:53,590 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-26 11:43:53,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:43:53,591 INFO L225 Difference]: With dead ends: 58 [2023-11-26 11:43:53,591 INFO L226 Difference]: Without dead ends: 58 [2023-11-26 11:43:53,592 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-26 11:43:53,594 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.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:43:53,595 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.1s Time] [2023-11-26 11:43:53,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-11-26 11:43:53,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-11-26 11:43:53,609 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-26 11:43:53,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2023-11-26 11:43:53,611 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 20 [2023-11-26 11:43:53,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:43:53,611 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2023-11-26 11:43:53,612 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-26 11:43:53,612 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2023-11-26 11:43:53,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-26 11:43:53,613 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:43:53,613 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:43:53,632 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-26 11:43:53,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:43:53,832 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-26 11:43:53,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:43:53,833 INFO L85 PathProgramCache]: Analyzing trace with hash 644040353, now seen corresponding path program 1 times [2023-11-26 11:43:53,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:43:53,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604165654] [2023-11-26 11:43:53,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:53,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:43:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:54,085 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-26 11:43:54,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:43:54,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604165654] [2023-11-26 11:43:54,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604165654] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:43:54,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:43:54,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:43:54,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217191656] [2023-11-26 11:43:54,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:43:54,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:43:54,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:43:54,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:43:54,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:43:54,088 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-26 11:43:54,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:43:54,243 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2023-11-26 11:43:54,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:43:54,244 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-26 11:43:54,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:43:54,245 INFO L225 Difference]: With dead ends: 58 [2023-11-26 11:43:54,245 INFO L226 Difference]: Without dead ends: 58 [2023-11-26 11:43:54,245 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-26 11:43:54,246 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-26 11:43:54,246 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-26 11:43:54,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-11-26 11:43:54,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-11-26 11:43:54,250 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-26 11:43:54,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2023-11-26 11:43:54,250 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 21 [2023-11-26 11:43:54,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:43:54,251 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2023-11-26 11:43:54,251 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-26 11:43:54,251 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2023-11-26 11:43:54,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-26 11:43:54,252 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:43:54,252 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:43:54,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 11:43:54,253 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-26 11:43:54,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:43:54,253 INFO L85 PathProgramCache]: Analyzing trace with hash 446255910, now seen corresponding path program 1 times [2023-11-26 11:43:54,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:43:54,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348218065] [2023-11-26 11:43:54,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:54,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:43:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:54,349 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-26 11:43:54,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:43:54,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348218065] [2023-11-26 11:43:54,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348218065] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:43:54,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:43:54,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:43:54,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472653813] [2023-11-26 11:43:54,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:43:54,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:43:54,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:43:54,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:43:54,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:43:54,352 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-26 11:43:54,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:43:54,386 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2023-11-26 11:43:54,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:43:54,387 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-26 11:43:54,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:43:54,388 INFO L225 Difference]: With dead ends: 71 [2023-11-26 11:43:54,388 INFO L226 Difference]: Without dead ends: 71 [2023-11-26 11:43:54,388 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-26 11:43:54,389 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-26 11:43:54,390 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-26 11:43:54,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-26 11:43:54,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 59. [2023-11-26 11:43:54,393 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-26 11:43:54,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2023-11-26 11:43:54,394 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 23 [2023-11-26 11:43:54,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:43:54,394 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2023-11-26 11:43:54,394 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-26 11:43:54,394 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2023-11-26 11:43:54,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-26 11:43:54,395 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:43:54,396 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-26 11:43:54,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 11:43:54,396 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-26 11:43:54,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:43:54,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1824954876, now seen corresponding path program 1 times [2023-11-26 11:43:54,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:43:54,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66707306] [2023-11-26 11:43:54,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:54,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:43:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:54,565 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-26 11:43:54,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:43:54,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66707306] [2023-11-26 11:43:54,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66707306] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:43:54,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:43:54,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:43:54,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274431171] [2023-11-26 11:43:54,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:43:54,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:43:54,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:43:54,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:43:54,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:43:54,569 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-26 11:43:54,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:43:54,709 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2023-11-26 11:43:54,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:43:54,710 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-26 11:43:54,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:43:54,711 INFO L225 Difference]: With dead ends: 77 [2023-11-26 11:43:54,711 INFO L226 Difference]: Without dead ends: 77 [2023-11-26 11:43:54,711 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-26 11:43:54,712 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-26 11:43:54,712 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-26 11:43:54,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-26 11:43:54,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 62. [2023-11-26 11:43:54,715 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-26 11:43:54,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2023-11-26 11:43:54,716 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 26 [2023-11-26 11:43:54,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:43:54,716 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2023-11-26 11:43:54,716 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-26 11:43:54,717 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2023-11-26 11:43:54,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-26 11:43:54,717 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:43:54,718 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-26 11:43:54,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 11:43:54,718 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-26 11:43:54,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:43:54,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1824954875, now seen corresponding path program 1 times [2023-11-26 11:43:54,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:43:54,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8087166] [2023-11-26 11:43:54,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:54,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:43:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:54,836 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-26 11:43:54,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:43:54,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8087166] [2023-11-26 11:43:54,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8087166] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:43:54,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392391138] [2023-11-26 11:43:54,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:54,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:43:54,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:43:54,838 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:43:54,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-26 11:43:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:54,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 11:43:54,999 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:43:55,065 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-26 11:43:55,065 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:43:55,119 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-26 11:43:55,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392391138] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:43:55,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:43:55,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-26 11:43:55,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916486823] [2023-11-26 11:43:55,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:43:55,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 11:43:55,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:43:55,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 11:43:55,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:43:55,122 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-26 11:43:55,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:43:55,214 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2023-11-26 11:43:55,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:43:55,214 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-26 11:43:55,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:43:55,217 INFO L225 Difference]: With dead ends: 103 [2023-11-26 11:43:55,217 INFO L226 Difference]: Without dead ends: 103 [2023-11-26 11:43:55,217 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-26 11:43:55,218 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-26 11:43:55,219 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-26 11:43:55,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-26 11:43:55,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 72. [2023-11-26 11:43:55,223 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-26 11:43:55,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 90 transitions. [2023-11-26 11:43:55,223 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 90 transitions. Word has length 26 [2023-11-26 11:43:55,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:43:55,224 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 90 transitions. [2023-11-26 11:43:55,224 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-26 11:43:55,224 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2023-11-26 11:43:55,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-26 11:43:55,225 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:43:55,225 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-26 11:43:55,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-26 11:43:55,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-26 11:43:55,433 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-26 11:43:55,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:43:55,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1823567296, now seen corresponding path program 1 times [2023-11-26 11:43:55,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:43:55,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850033351] [2023-11-26 11:43:55,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:55,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:43:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:55,626 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-26 11:43:55,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:43:55,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850033351] [2023-11-26 11:43:55,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850033351] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:43:55,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378273282] [2023-11-26 11:43:55,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:55,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:43:55,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:43:55,631 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:43:55,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-26 11:43:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:55,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-26 11:43:55,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:43:55,869 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-26 11:43:55,869 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:43:55,905 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-26 11:43:55,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378273282] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:43:55,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:43:55,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2023-11-26 11:43:55,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830320047] [2023-11-26 11:43:55,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:43:55,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 11:43:55,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:43:55,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 11:43:55,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:43:55,910 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-26 11:43:56,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:43:56,008 INFO L93 Difference]: Finished difference Result 100 states and 118 transitions. [2023-11-26 11:43:56,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 11:43:56,009 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-26 11:43:56,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:43:56,012 INFO L225 Difference]: With dead ends: 100 [2023-11-26 11:43:56,012 INFO L226 Difference]: Without dead ends: 100 [2023-11-26 11:43:56,013 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-26 11:43:56,014 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-26 11:43:56,015 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-26 11:43:56,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-26 11:43:56,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 75. [2023-11-26 11:43:56,021 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-26 11:43:56,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 94 transitions. [2023-11-26 11:43:56,022 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 94 transitions. Word has length 26 [2023-11-26 11:43:56,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:43:56,022 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 94 transitions. [2023-11-26 11:43:56,022 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-26 11:43:56,023 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2023-11-26 11:43:56,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-26 11:43:56,026 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:43:56,027 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-26 11:43:56,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-26 11:43:56,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-26 11:43:56,234 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-26 11:43:56,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:43:56,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1823567351, now seen corresponding path program 1 times [2023-11-26 11:43:56,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:43:56,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653076609] [2023-11-26 11:43:56,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:56,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:43:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:57,055 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-26 11:43:57,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:43:57,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653076609] [2023-11-26 11:43:57,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653076609] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:43:57,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545202804] [2023-11-26 11:43:57,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:57,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:43:57,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:43:57,058 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:43:57,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-26 11:43:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:57,230 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-26 11:43:57,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:43:57,238 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-26 11:43:57,273 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-26 11:43:57,273 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-26 11:43:57,292 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-26 11:43:57,310 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-26 11:43:57,370 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-26 11:43:57,370 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-26 11:43:57,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:43:57,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:43:57,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:43:57,574 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-26 11:43:57,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:43:57,650 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-26 11:43:57,655 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-26 11:43:57,655 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:43:57,697 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-26 11:43:57,819 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2023-11-26 11:43:57,820 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-26 11:43:57,881 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-26 11:43:57,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:43:57,896 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-26 11:43:57,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:43:57,905 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-26 11:43:57,911 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-26 11:43:57,988 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-26 11:43:57,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545202804] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:43:57,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:43:57,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2023-11-26 11:43:57,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985490105] [2023-11-26 11:43:57,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:43:57,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-26 11:43:57,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:43:57,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-26 11:43:57,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=612, Unknown=8, NotChecked=102, Total=812 [2023-11-26 11:43:57,991 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-26 11:43:58,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:43:58,844 INFO L93 Difference]: Finished difference Result 137 states and 174 transitions. [2023-11-26 11:43:58,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-26 11:43:58,845 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-26 11:43:58,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:43:58,846 INFO L225 Difference]: With dead ends: 137 [2023-11-26 11:43:58,846 INFO L226 Difference]: Without dead ends: 137 [2023-11-26 11:43:58,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=238, Invalid=1094, Unknown=8, NotChecked=142, Total=1482 [2023-11-26 11:43:58,847 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-26 11:43:58,848 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-26 11:43:58,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-26 11:43:58,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 82. [2023-11-26 11:43:58,850 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-26 11:43:58,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 106 transitions. [2023-11-26 11:43:58,851 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 106 transitions. Word has length 26 [2023-11-26 11:43:58,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:43:58,851 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 106 transitions. [2023-11-26 11:43:58,851 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-26 11:43:58,851 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2023-11-26 11:43:58,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-26 11:43:58,852 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:43:58,853 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-26 11:43:58,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-26 11:43:59,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-26 11:43:59,053 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-26 11:43:59,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:43:59,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1823567350, now seen corresponding path program 1 times [2023-11-26 11:43:59,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:43:59,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913630119] [2023-11-26 11:43:59,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:59,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:43:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:00,159 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-26 11:44:00,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:00,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913630119] [2023-11-26 11:44:00,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913630119] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:44:00,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499853121] [2023-11-26 11:44:00,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:00,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:44:00,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:00,161 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:44:00,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-26 11:44:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:00,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-26 11:44:00,348 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:44:00,356 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-26 11:44:00,460 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-26 11:44:00,461 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-26 11:44:00,522 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-26 11:44:00,529 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-26 11:44:00,587 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-26 11:44:00,601 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-26 11:44:00,714 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-26 11:44:00,715 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-26 11:44:00,726 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-26 11:44:01,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:44:01,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:44:01,072 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-26 11:44:01,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:44:01,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:44:01,083 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-26 11:44:01,201 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-26 11:44:01,207 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-26 11:44:01,243 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-26 11:44:01,243 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:44:01,427 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-26 11:44:01,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:44:01,742 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-26 11:44:01,904 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-26 11:44:01,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:44:01,918 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-26 11:44:01,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:44:01,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 32 [2023-11-26 11:44:01,928 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-26 11:44:01,938 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-26 11:44:01,938 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-26 11:44:01,945 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-26 11:44:01,945 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-26 11:44:02,170 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-26 11:44:02,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499853121] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:44:02,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:44:02,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2023-11-26 11:44:02,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842544994] [2023-11-26 11:44:02,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:44:02,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-26 11:44:02,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:02,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-26 11:44:02,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=949, Unknown=14, NotChecked=126, Total=1190 [2023-11-26 11:44:02,174 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-26 11:44:03,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:44:03,619 INFO L93 Difference]: Finished difference Result 144 states and 184 transitions. [2023-11-26 11:44:03,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-26 11:44:03,620 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-26 11:44:03,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:44:03,621 INFO L225 Difference]: With dead ends: 144 [2023-11-26 11:44:03,621 INFO L226 Difference]: Without dead ends: 144 [2023-11-26 11:44:03,622 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-26 11:44:03,623 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-26 11:44:03,623 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-26 11:44:03,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-11-26 11:44:03,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 87. [2023-11-26 11:44:03,626 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-26 11:44:03,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 114 transitions. [2023-11-26 11:44:03,626 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 114 transitions. Word has length 26 [2023-11-26 11:44:03,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:44:03,627 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 114 transitions. [2023-11-26 11:44:03,627 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-26 11:44:03,627 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 114 transitions. [2023-11-26 11:44:03,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-26 11:44:03,627 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:44:03,628 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-26 11:44:03,644 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-26 11:44:03,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-26 11:44:03,835 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-26 11:44:03,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:03,835 INFO L85 PathProgramCache]: Analyzing trace with hash -550699417, now seen corresponding path program 2 times [2023-11-26 11:44:03,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:03,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886344589] [2023-11-26 11:44:03,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:03,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:03,944 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-26 11:44:03,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:03,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886344589] [2023-11-26 11:44:03,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886344589] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:44:03,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138525449] [2023-11-26 11:44:03,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-26 11:44:03,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:44:03,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:03,951 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:44:03,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-26 11:44:04,148 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-26 11:44:04,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 11:44:04,150 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-26 11:44:04,152 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:44:04,170 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-26 11:44:04,170 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:44:04,192 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-26 11:44:04,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138525449] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:44:04,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:44:04,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2023-11-26 11:44:04,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139857934] [2023-11-26 11:44:04,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:44:04,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:44:04,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:04,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:44:04,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:44:04,196 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-26 11:44:04,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:44:04,266 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2023-11-26 11:44:04,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:44:04,266 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-26 11:44:04,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:44:04,267 INFO L225 Difference]: With dead ends: 88 [2023-11-26 11:44:04,267 INFO L226 Difference]: Without dead ends: 88 [2023-11-26 11:44:04,268 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-26 11:44:04,268 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 87 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-26 11:44:04,269 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-26 11:44:04,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-26 11:44:04,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2023-11-26 11:44:04,272 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-26 11:44:04,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 102 transitions. [2023-11-26 11:44:04,273 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 102 transitions. Word has length 29 [2023-11-26 11:44:04,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:44:04,274 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 102 transitions. [2023-11-26 11:44:04,274 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-26 11:44:04,274 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 102 transitions. [2023-11-26 11:44:04,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-26 11:44:04,275 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:44:04,275 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-26 11:44:04,282 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-26 11:44:04,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-26 11:44:04,482 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-26 11:44:04,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:04,483 INFO L85 PathProgramCache]: Analyzing trace with hash 802280508, now seen corresponding path program 1 times [2023-11-26 11:44:04,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:04,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394254990] [2023-11-26 11:44:04,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:04,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:04,808 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-26 11:44:04,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:04,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394254990] [2023-11-26 11:44:04,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394254990] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:44:04,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:44:04,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:44:04,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667853036] [2023-11-26 11:44:04,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:44:04,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:44:04,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:04,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:44:04,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:44:04,811 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-26 11:44:04,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:44:04,954 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2023-11-26 11:44:04,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:44:04,955 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-26 11:44:04,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:44:04,955 INFO L225 Difference]: With dead ends: 81 [2023-11-26 11:44:04,955 INFO L226 Difference]: Without dead ends: 81 [2023-11-26 11:44:04,956 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-26 11:44:04,956 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-26 11:44:04,957 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-26 11:44:04,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-26 11:44:04,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-11-26 11:44:04,960 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-26 11:44:04,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2023-11-26 11:44:04,960 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 98 transitions. Word has length 31 [2023-11-26 11:44:04,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:44:04,961 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 98 transitions. [2023-11-26 11:44:04,961 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-26 11:44:04,961 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2023-11-26 11:44:04,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-26 11:44:04,962 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:44:04,962 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-26 11:44:04,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-26 11:44:04,963 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-26 11:44:04,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:04,963 INFO L85 PathProgramCache]: Analyzing trace with hash 803668087, now seen corresponding path program 2 times [2023-11-26 11:44:04,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:04,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519893356] [2023-11-26 11:44:04,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:04,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:05,089 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-26 11:44:05,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:05,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519893356] [2023-11-26 11:44:05,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519893356] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:44:05,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134024772] [2023-11-26 11:44:05,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-26 11:44:05,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:44:05,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:05,095 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:44:05,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-26 11:44:05,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-26 11:44:05,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 11:44:05,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-26 11:44:05,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:44:05,423 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-26 11:44:05,424 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:44:05,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134024772] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:44:05,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 11:44:05,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2023-11-26 11:44:05,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434888030] [2023-11-26 11:44:05,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:44:05,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:44:05,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:05,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:44:05,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-26 11:44:05,427 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-26 11:44:05,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:44:05,481 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2023-11-26 11:44:05,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:44:05,482 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-26 11:44:05,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:44:05,483 INFO L225 Difference]: With dead ends: 73 [2023-11-26 11:44:05,483 INFO L226 Difference]: Without dead ends: 73 [2023-11-26 11:44:05,483 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-26 11:44:05,484 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-26 11:44:05,484 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-26 11:44:05,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-26 11:44:05,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2023-11-26 11:44:05,487 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-26 11:44:05,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2023-11-26 11:44:05,488 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 31 [2023-11-26 11:44:05,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:44:05,488 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2023-11-26 11:44:05,488 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-26 11:44:05,488 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2023-11-26 11:44:05,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-26 11:44:05,489 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:44:05,489 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-26 11:44:05,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-26 11:44:05,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:44:05,696 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-26 11:44:05,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:05,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2102421820, now seen corresponding path program 1 times [2023-11-26 11:44:05,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:05,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200052598] [2023-11-26 11:44:05,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:05,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:05,818 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-26 11:44:05,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:05,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200052598] [2023-11-26 11:44:05,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200052598] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:44:05,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:44:05,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:44:05,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264267676] [2023-11-26 11:44:05,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:44:05,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:44:05,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:05,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:44:05,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:44:05,822 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-26 11:44:05,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:44:05,871 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2023-11-26 11:44:05,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:44:05,871 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-26 11:44:05,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:44:05,872 INFO L225 Difference]: With dead ends: 65 [2023-11-26 11:44:05,872 INFO L226 Difference]: Without dead ends: 65 [2023-11-26 11:44:05,873 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-26 11:44:05,874 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-26 11:44:05,875 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-26 11:44:05,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-26 11:44:05,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2023-11-26 11:44:05,882 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-26 11:44:05,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2023-11-26 11:44:05,883 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 33 [2023-11-26 11:44:05,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:44:05,883 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2023-11-26 11:44:05,884 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-26 11:44:05,884 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2023-11-26 11:44:05,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-26 11:44:05,885 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:44:05,885 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-26 11:44:05,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-26 11:44:05,886 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-26 11:44:05,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:05,887 INFO L85 PathProgramCache]: Analyzing trace with hash -752458600, now seen corresponding path program 1 times [2023-11-26 11:44:05,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:05,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769643516] [2023-11-26 11:44:05,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:05,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:07,077 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-26 11:44:07,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:07,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769643516] [2023-11-26 11:44:07,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769643516] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:44:07,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312528934] [2023-11-26 11:44:07,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:07,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:44:07,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:07,080 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:44:07,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-26 11:44:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:07,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 80 conjunts are in the unsatisfiable core [2023-11-26 11:44:07,293 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:44:07,314 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-26 11:44:07,400 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-26 11:44:07,400 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-26 11:44:07,468 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-26 11:44:07,512 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-26 11:44:07,588 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-26 11:44:07,589 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-26 11:44:07,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:44:07,839 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-26 11:44:07,850 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-26 11:44:07,990 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-26 11:44:08,044 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-26 11:44:08,216 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-26 11:44:08,216 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:44:08,411 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-26 11:44:08,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:44:08,428 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-26 11:44:08,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:44:08,441 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-26 11:44:08,449 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-26 11:44:08,743 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-26 11:44:08,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:44:08,761 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-26 11:44:08,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:44:08,769 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-26 11:44:08,773 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-26 11:44:08,868 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-26 11:44:08,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312528934] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:44:08,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:44:08,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 48 [2023-11-26 11:44:08,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167205527] [2023-11-26 11:44:08,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:44:08,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-26 11:44:08,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:08,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-26 11:44:08,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1858, Unknown=34, NotChecked=178, Total=2256 [2023-11-26 11:44:08,872 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-26 11:44:10,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:44:10,063 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2023-11-26 11:44:10,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-26 11:44:10,064 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-26 11:44:10,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:44:10,064 INFO L225 Difference]: With dead ends: 69 [2023-11-26 11:44:10,065 INFO L226 Difference]: Without dead ends: 69 [2023-11-26 11:44:10,067 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-26 11:44:10,068 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.6s IncrementalHoareTripleChecker+Time [2023-11-26 11:44:10,068 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.6s Time] [2023-11-26 11:44:10,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-26 11:44:10,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2023-11-26 11:44:10,070 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-26 11:44:10,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2023-11-26 11:44:10,071 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 34 [2023-11-26 11:44:10,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:44:10,071 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2023-11-26 11:44:10,072 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-26 11:44:10,072 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2023-11-26 11:44:10,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-26 11:44:10,072 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:44:10,073 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-26 11:44:10,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-26 11:44:10,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:44:10,280 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-26 11:44:10,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:10,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1234002308, now seen corresponding path program 1 times [2023-11-26 11:44:10,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:10,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488673368] [2023-11-26 11:44:10,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:10,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:12,072 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-26 11:44:12,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:12,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488673368] [2023-11-26 11:44:12,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488673368] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:44:12,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922019947] [2023-11-26 11:44:12,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:12,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:44:12,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:12,074 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:44:12,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-26 11:44:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:12,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-26 11:44:12,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:44:12,331 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-26 11:44:12,403 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-26 11:44:12,403 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-26 11:44:12,454 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-26 11:44:12,503 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-26 11:44:12,585 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-26 11:44:12,585 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-26 11:44:12,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:44:12,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:44:12,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:44:12,864 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-26 11:44:13,082 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-26 11:44:13,083 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-26 11:44:13,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:44:13,231 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-26 11:44:13,237 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-26 11:44:13,237 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:44:13,337 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-26 11:44:13,348 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-26 11:44:13,359 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-26 11:44:13,372 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-26 11:44:13,399 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-26 11:44:13,417 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-26 11:44:13,448 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-26 11:44:13,475 INFO L349 Elim1Store]: treesize reduction 5, result has 81.5 percent of original size [2023-11-26 11:44:13,476 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-26 11:44:13,491 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-26 11:44:13,528 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-26 11:44:13,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:44:13,548 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-26 11:44:13,555 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-26 11:44:13,566 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-26 11:44:13,566 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-26 11:44:13,573 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-26 11:44:13,574 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-26 11:44:13,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:44:13,583 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-26 11:44:13,596 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-26 11:44:13,617 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-26 11:44:13,618 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-26 11:44:13,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:44:13,626 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-26 11:44:13,748 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-26 11:44:13,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922019947] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:44:13,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:44:13,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 16] total 46 [2023-11-26 11:44:13,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345320505] [2023-11-26 11:44:13,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:44:13,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-11-26 11:44:13,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:13,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-11-26 11:44:13,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1278, Unknown=9, NotChecked=720, Total=2162 [2023-11-26 11:44:13,753 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-26 11:44:15,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:44:15,480 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2023-11-26 11:44:15,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-26 11:44:15,481 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-26 11:44:15,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:44:15,482 INFO L225 Difference]: With dead ends: 87 [2023-11-26 11:44:15,482 INFO L226 Difference]: Without dead ends: 87 [2023-11-26 11:44:15,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=395, Invalid=2494, Unknown=9, NotChecked=1008, Total=3906 [2023-11-26 11:44:15,485 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-26 11:44:15,486 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-26 11:44:15,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-26 11:44:15,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 65. [2023-11-26 11:44:15,488 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-26 11:44:15,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2023-11-26 11:44:15,489 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 37 [2023-11-26 11:44:15,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:44:15,489 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2023-11-26 11:44:15,490 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-26 11:44:15,490 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2023-11-26 11:44:15,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-26 11:44:15,491 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:44:15,491 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-26 11:44:15,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-26 11:44:15,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:44:15,698 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-26 11:44:15,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:15,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1234002307, now seen corresponding path program 1 times [2023-11-26 11:44:15,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:15,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174457921] [2023-11-26 11:44:15,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:15,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:17,701 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-26 11:44:17,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:17,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174457921] [2023-11-26 11:44:17,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174457921] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:44:17,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858503088] [2023-11-26 11:44:17,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:17,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:44:17,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:17,707 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:44:17,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-26 11:44:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:17,975 INFO L262 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-26 11:44:17,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:44:17,984 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-26 11:44:18,063 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-26 11:44:18,064 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-26 11:44:18,112 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-26 11:44:18,118 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-26 11:44:18,169 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-26 11:44:18,177 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-26 11:44:18,294 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-26 11:44:18,295 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-26 11:44:18,300 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-26 11:44:18,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:44:18,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:44:18,624 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-26 11:44:18,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:44:18,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2023-11-26 11:44:18,876 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-26 11:44:18,876 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-26 11:44:18,885 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-26 11:44:19,079 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-26 11:44:19,086 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-26 11:44:19,143 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-26 11:44:19,143 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:44:19,378 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-26 11:44:19,407 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-26 11:44:19,595 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-26 11:44:19,664 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-26 11:44:19,703 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-26 11:44:19,787 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-26 11:44:19,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:44:19,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 128 [2023-11-26 11:44:19,962 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-26 11:44:20,115 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-26 11:44:20,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:44:20,156 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-26 11:44:20,171 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-26 11:44:20,177 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-26 11:44:20,180 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-26 11:44:20,187 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-26 11:44:20,190 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-26 11:44:20,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:44:20,203 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-26 11:44:20,209 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-26 11:44:20,214 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-26 11:44:20,217 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-26 11:44:20,222 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-26 11:44:20,227 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-26 11:44:20,236 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-26 11:44:20,245 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-26 11:44:20,253 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-26 11:44:20,253 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-26 11:44:20,261 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-26 11:44:20,268 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-26 11:44:20,269 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-26 11:44:20,518 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-26 11:44:20,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858503088] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:44:20,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:44:20,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 16] total 43 [2023-11-26 11:44:20,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346793539] [2023-11-26 11:44:20,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:44:20,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-26 11:44:20,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:20,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-26 11:44:20,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1131, Unknown=28, NotChecked=600, Total=1892 [2023-11-26 11:44:20,525 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-26 11:44:23,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:44:23,300 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2023-11-26 11:44:23,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-26 11:44:23,301 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-26 11:44:23,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:44:23,302 INFO L225 Difference]: With dead ends: 72 [2023-11-26 11:44:23,302 INFO L226 Difference]: Without dead ends: 72 [2023-11-26 11:44:23,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=336, Invalid=2115, Unknown=31, NotChecked=824, Total=3306 [2023-11-26 11:44:23,304 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 96 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2023-11-26 11:44:23,305 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.8s Time] [2023-11-26 11:44:23,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-26 11:44:23,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2023-11-26 11:44:23,307 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-26 11:44:23,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2023-11-26 11:44:23,308 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 37 [2023-11-26 11:44:23,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:44:23,308 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2023-11-26 11:44:23,308 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-26 11:44:23,309 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2023-11-26 11:44:23,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-26 11:44:23,309 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:44:23,309 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-26 11:44:23,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-26 11:44:23,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:44:23,523 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-26 11:44:23,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:23,524 INFO L85 PathProgramCache]: Analyzing trace with hash 398742496, now seen corresponding path program 1 times [2023-11-26 11:44:23,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:23,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500107963] [2023-11-26 11:44:23,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:23,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:23,637 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-26 11:44:23,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:23,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500107963] [2023-11-26 11:44:23,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500107963] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:44:23,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732158167] [2023-11-26 11:44:23,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:23,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:44:23,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:23,640 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:44:23,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-26 11:44:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:23,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-26 11:44:23,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:44:23,922 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-26 11:44:23,922 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:44:23,945 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-26 11:44:23,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732158167] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:44:23,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:44:23,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2023-11-26 11:44:23,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562226582] [2023-11-26 11:44:23,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:44:23,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:44:23,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:23,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:44:23,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:44:23,948 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-26 11:44:24,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:44:24,013 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2023-11-26 11:44:24,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:44:24,014 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-26 11:44:24,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:44:24,015 INFO L225 Difference]: With dead ends: 64 [2023-11-26 11:44:24,015 INFO L226 Difference]: Without dead ends: 64 [2023-11-26 11:44:24,016 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-26 11:44:24,017 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-26 11:44:24,018 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-26 11:44:24,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-26 11:44:24,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-11-26 11:44:24,021 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-26 11:44:24,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2023-11-26 11:44:24,022 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 38 [2023-11-26 11:44:24,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:44:24,022 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2023-11-26 11:44:24,022 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-26 11:44:24,022 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2023-11-26 11:44:24,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-26 11:44:24,023 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:44:24,023 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-26 11:44:24,037 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-26 11:44:24,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:44:24,232 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-26 11:44:24,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:24,233 INFO L85 PathProgramCache]: Analyzing trace with hash -465120059, now seen corresponding path program 2 times [2023-11-26 11:44:24,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:24,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626053827] [2023-11-26 11:44:24,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:24,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:24,365 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-26 11:44:24,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:24,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626053827] [2023-11-26 11:44:24,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626053827] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:44:24,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827430432] [2023-11-26 11:44:24,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-26 11:44:24,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:44:24,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:24,368 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:44:24,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-26 11:44:24,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-26 11:44:24,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 11:44:24,651 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-26 11:44:24,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:44:24,722 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-26 11:44:24,722 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:44:24,788 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-26 11:44:24,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827430432] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:44:24,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:44:24,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 7 [2023-11-26 11:44:24,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614681864] [2023-11-26 11:44:24,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:44:24,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 11:44:24,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:24,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 11:44:24,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:44:24,791 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-26 11:44:24,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:44:24,897 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2023-11-26 11:44:24,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 11:44:24,898 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-26 11:44:24,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:44:24,899 INFO L225 Difference]: With dead ends: 56 [2023-11-26 11:44:24,899 INFO L226 Difference]: Without dead ends: 56 [2023-11-26 11:44:24,899 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-26 11:44:24,900 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.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:44:24,901 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.1s Time] [2023-11-26 11:44:24,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-26 11:44:24,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-11-26 11:44:24,903 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-26 11:44:24,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2023-11-26 11:44:24,904 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 39 [2023-11-26 11:44:24,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:44:24,905 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2023-11-26 11:44:24,906 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-26 11:44:24,906 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2023-11-26 11:44:24,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-26 11:44:24,907 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:44:24,907 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-26 11:44:24,920 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-26 11:44:25,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-26 11:44:25,115 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-26 11:44:25,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:25,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1535711561, now seen corresponding path program 1 times [2023-11-26 11:44:25,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:25,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46094994] [2023-11-26 11:44:25,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:25,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:26,531 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-26 11:44:26,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:26,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46094994] [2023-11-26 11:44:26,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46094994] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:44:26,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316315649] [2023-11-26 11:44:26,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:26,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:44:26,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:26,533 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:44:26,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-26 11:44:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:26,785 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 92 conjunts are in the unsatisfiable core [2023-11-26 11:44:26,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:44:26,813 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-26 11:44:26,905 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-26 11:44:26,906 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-26 11:44:26,961 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-26 11:44:27,015 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-26 11:44:27,097 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-26 11:44:27,097 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-26 11:44:27,344 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-26 11:44:27,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:44:27,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-26 11:44:27,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:44:27,356 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-26 11:44:27,645 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-26 11:44:27,646 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-26 11:44:27,655 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-26 11:44:27,660 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-26 11:44:28,014 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-26 11:44:28,019 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-26 11:44:28,099 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-26 11:44:28,100 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:44:28,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 86 treesize of output 64 [2023-11-26 11:44:28,304 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-26 11:44:28,479 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-26 11:44:28,490 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-26 11:44:28,496 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-26 11:44:28,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2023-11-26 11:44:28,537 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-26 11:44:28,589 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-26 11:44:28,622 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-26 11:44:28,667 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-26 11:44:28,696 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-26 11:44:28,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:44:28,924 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-26 11:44:28,931 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-26 11:44:28,937 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-26 11:44:28,938 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-26 11:44:28,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:44:28,953 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-26 11:44:28,967 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-26 11:44:28,968 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-26 11:44:28,975 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-26 11:44:28,989 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-26 11:44:28,990 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-26 11:44:28,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-26 11:44:28,996 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-26 11:44:29,004 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-11-26 11:44:29,004 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-26 11:44:29,150 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-26 11:44:29,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316315649] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:44:29,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:44:29,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 55 [2023-11-26 11:44:29,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778068900] [2023-11-26 11:44:29,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:44:29,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-11-26 11:44:29,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:29,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-11-26 11:44:29,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2065, Unknown=24, NotChecked=686, Total=2970 [2023-11-26 11:44:29,154 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-26 11:44:30,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:44:30,847 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2023-11-26 11:44:30,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-26 11:44:30,847 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-26 11:44:30,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:44:30,848 INFO L225 Difference]: With dead ends: 60 [2023-11-26 11:44:30,848 INFO L226 Difference]: Without dead ends: 60 [2023-11-26 11:44:30,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=415, Invalid=3371, Unknown=24, NotChecked=882, Total=4692 [2023-11-26 11:44:30,851 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 66 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2023-11-26 11:44:30,851 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.7s Time] [2023-11-26 11:44:30,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-26 11:44:30,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2023-11-26 11:44:30,853 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-26 11:44:30,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2023-11-26 11:44:30,853 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 40 [2023-11-26 11:44:30,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:44:30,854 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2023-11-26 11:44:30,854 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-26 11:44:30,854 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2023-11-26 11:44:30,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-26 11:44:30,855 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:44:30,855 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-26 11:44:30,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-26 11:44:31,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:44:31,063 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-26 11:44:31,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:31,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1644283671, now seen corresponding path program 1 times [2023-11-26 11:44:31,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:31,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399609892] [2023-11-26 11:44:31,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:31,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:31,207 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-26 11:44:31,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:31,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399609892] [2023-11-26 11:44:31,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399609892] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:44:31,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162255436] [2023-11-26 11:44:31,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:31,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:44:31,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:31,209 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:44:31,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a185fc5-ea52-48e7-9108-349fb9dae06e/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-26 11:44:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:31,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-26 11:44:31,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:44:31,488 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-26 11:44:31,548 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-26 11:44:31,549 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:44:31,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162255436] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:44:31,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 11:44:31,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 6 [2023-11-26 11:44:31,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431102971] [2023-11-26 11:44:31,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:44:31,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:44:31,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:31,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:44:31,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:44:31,552 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)