./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 583b66b9d59d34de12ff7e58a8eb24a95055476e3f5044dc2a7c6b2bb83f4c67 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:59:13,830 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:59:13,886 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 18:59:13,890 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:59:13,891 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:59:13,915 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:59:13,917 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:59:13,917 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:59:13,918 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:59:13,920 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:59:13,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:59:13,921 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:59:13,921 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:59:13,922 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:59:13,922 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:59:13,922 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:59:13,923 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 18:59:13,923 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:59:13,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 18:59:13,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:59:13,924 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:59:13,925 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:59:13,925 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 18:59:13,925 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:59:13,926 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:59:13,926 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:59:13,926 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:59:13,926 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 18:59:13,926 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:59:13,927 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:59:13,927 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:59:13,927 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:59:13,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:59:13,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:59:13,928 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:59:13,928 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:59:13,929 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 18:59:13,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 18:59:13,929 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:59:13,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:59:13,930 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:59:13,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:59:13,930 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 583b66b9d59d34de12ff7e58a8eb24a95055476e3f5044dc2a7c6b2bb83f4c67 [2024-11-22 18:59:14,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:59:14,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:59:14,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:59:14,168 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:59:14,169 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:59:14,170 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i [2024-11-22 18:59:15,354 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:59:15,572 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:59:15,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_unequal.i [2024-11-22 18:59:15,609 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab3aac5b8/24c3f9f5232845b8a4927ff88471364a/FLAG9d5363ebe [2024-11-22 18:59:15,950 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab3aac5b8/24c3f9f5232845b8a4927ff88471364a [2024-11-22 18:59:15,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:59:15,953 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:59:15,954 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:59:15,954 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:59:15,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:59:15,961 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:59:15" (1/1) ... [2024-11-22 18:59:15,962 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5295bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:15, skipping insertion in model container [2024-11-22 18:59:15,962 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:59:15" (1/1) ... [2024-11-22 18:59:16,007 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:59:16,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:59:16,292 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 18:59:16,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:59:16,363 INFO L204 MainTranslator]: Completed translation [2024-11-22 18:59:16,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:16 WrapperNode [2024-11-22 18:59:16,365 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:59:16,366 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 18:59:16,366 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 18:59:16,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 18:59:16,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:16" (1/1) ... [2024-11-22 18:59:16,391 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:16" (1/1) ... [2024-11-22 18:59:16,418 INFO L138 Inliner]: procedures = 127, calls = 50, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 154 [2024-11-22 18:59:16,419 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 18:59:16,420 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 18:59:16,420 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 18:59:16,420 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 18:59:16,428 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:16" (1/1) ... [2024-11-22 18:59:16,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:16" (1/1) ... [2024-11-22 18:59:16,433 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:16" (1/1) ... [2024-11-22 18:59:16,459 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 20, 9]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 15 writes are split as follows [0, 13, 2]. [2024-11-22 18:59:16,459 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:16" (1/1) ... [2024-11-22 18:59:16,459 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:16" (1/1) ... [2024-11-22 18:59:16,465 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:16" (1/1) ... [2024-11-22 18:59:16,468 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:16" (1/1) ... [2024-11-22 18:59:16,469 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:16" (1/1) ... [2024-11-22 18:59:16,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:16" (1/1) ... [2024-11-22 18:59:16,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 18:59:16,473 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 18:59:16,473 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 18:59:16,474 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 18:59:16,474 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:16" (1/1) ... [2024-11-22 18:59:16,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:59:16,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:59:16,500 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 18:59:16,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 18:59:16,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 18:59:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 18:59:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-22 18:59:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 18:59:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 18:59:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-22 18:59:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-22 18:59:16,537 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-22 18:59:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 18:59:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 18:59:16,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 18:59:16,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 18:59:16,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 18:59:16,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-22 18:59:16,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 18:59:16,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 18:59:16,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-22 18:59:16,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 18:59:16,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-22 18:59:16,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-22 18:59:16,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-22 18:59:16,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 18:59:16,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 18:59:16,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-22 18:59:16,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 18:59:16,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 18:59:16,639 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 18:59:16,641 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 18:59:16,943 INFO L? ?]: Removed 156 outVars from TransFormulas that were not future-live. [2024-11-22 18:59:16,944 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 18:59:16,955 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 18:59:16,957 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-22 18:59:16,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:59:16 BoogieIcfgContainer [2024-11-22 18:59:16,958 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 18:59:16,959 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 18:59:16,959 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 18:59:16,962 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 18:59:16,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:59:15" (1/3) ... [2024-11-22 18:59:16,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123e907f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:59:16, skipping insertion in model container [2024-11-22 18:59:16,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:16" (2/3) ... [2024-11-22 18:59:16,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123e907f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:59:16, skipping insertion in model container [2024-11-22 18:59:16,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:59:16" (3/3) ... [2024-11-22 18:59:16,964 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_unequal.i [2024-11-22 18:59:16,977 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 18:59:16,977 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2024-11-22 18:59:17,022 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:59:17,026 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@53ca841d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:59:17,027 INFO L334 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2024-11-22 18:59:17,030 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 73 states have (on average 2.0684931506849313) internal successors, (151), 137 states have internal predecessors, (151), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:17,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-22 18:59:17,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:17,036 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-22 18:59:17,036 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 18:59:17,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:17,039 INFO L85 PathProgramCache]: Analyzing trace with hash 895949618, now seen corresponding path program 1 times [2024-11-22 18:59:17,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:17,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270728894] [2024-11-22 18:59:17,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:17,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:17,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:59:17,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:17,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270728894] [2024-11-22 18:59:17,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270728894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:59:17,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:59:17,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:59:17,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931102953] [2024-11-22 18:59:17,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:59:17,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:59:17,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:17,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:59:17,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:59:17,309 INFO L87 Difference]: Start difference. First operand has 142 states, 73 states have (on average 2.0684931506849313) internal successors, (151), 137 states have internal predecessors, (151), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-22 18:59:17,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:17,431 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2024-11-22 18:59:17,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:59:17,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-22 18:59:17,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:17,439 INFO L225 Difference]: With dead ends: 138 [2024-11-22 18:59:17,440 INFO L226 Difference]: Without dead ends: 135 [2024-11-22 18:59:17,441 INFO L431 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 [2024-11-22 18:59:17,444 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 3 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:17,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 218 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:59:17,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-22 18:59:17,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-22 18:59:17,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 70 states have (on average 1.9714285714285715) internal successors, (138), 130 states have internal predecessors, (138), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:17,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2024-11-22 18:59:17,477 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 6 [2024-11-22 18:59:17,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:17,478 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2024-11-22 18:59:17,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-22 18:59:17,478 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2024-11-22 18:59:17,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-22 18:59:17,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:17,478 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-22 18:59:17,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 18:59:17,479 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 18:59:17,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:17,479 INFO L85 PathProgramCache]: Analyzing trace with hash 895949619, now seen corresponding path program 1 times [2024-11-22 18:59:17,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:17,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216099722] [2024-11-22 18:59:17,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:17,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:17,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:59:17,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:17,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216099722] [2024-11-22 18:59:17,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216099722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:59:17,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:59:17,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:59:17,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640514330] [2024-11-22 18:59:17,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:59:17,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:59:17,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:17,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:59:17,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:59:17,573 INFO L87 Difference]: Start difference. First operand 135 states and 144 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-22 18:59:17,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:17,647 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2024-11-22 18:59:17,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:59:17,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-22 18:59:17,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:17,651 INFO L225 Difference]: With dead ends: 132 [2024-11-22 18:59:17,652 INFO L226 Difference]: Without dead ends: 132 [2024-11-22 18:59:17,652 INFO L431 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 [2024-11-22 18:59:17,653 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 3 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:17,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 219 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:59:17,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-22 18:59:17,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-22 18:59:17,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 70 states have (on average 1.9285714285714286) internal successors, (135), 127 states have internal predecessors, (135), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:17,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2024-11-22 18:59:17,666 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 6 [2024-11-22 18:59:17,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:17,667 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2024-11-22 18:59:17,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-22 18:59:17,667 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2024-11-22 18:59:17,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-22 18:59:17,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:17,668 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:17,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 18:59:17,668 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 18:59:17,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:17,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1271068585, now seen corresponding path program 1 times [2024-11-22 18:59:17,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:17,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461280440] [2024-11-22 18:59:17,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:17,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:17,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:59:17,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:17,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461280440] [2024-11-22 18:59:17,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461280440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:59:17,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:59:17,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:59:17,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643722734] [2024-11-22 18:59:17,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:59:17,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:59:17,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:17,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:59:17,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:59:17,757 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:59:17,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:17,772 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2024-11-22 18:59:17,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:59:17,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-22 18:59:17,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:17,774 INFO L225 Difference]: With dead ends: 143 [2024-11-22 18:59:17,775 INFO L226 Difference]: Without dead ends: 143 [2024-11-22 18:59:17,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:59:17,776 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 10 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:17,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 273 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:59:17,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-22 18:59:17,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 133. [2024-11-22 18:59:17,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 71 states have (on average 1.9154929577464788) internal successors, (136), 128 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:17,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2024-11-22 18:59:17,789 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 14 [2024-11-22 18:59:17,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:17,789 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2024-11-22 18:59:17,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:59:17,790 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2024-11-22 18:59:17,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 18:59:17,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:17,790 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:17,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 18:59:17,790 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 18:59:17,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:17,791 INFO L85 PathProgramCache]: Analyzing trace with hash -29197696, now seen corresponding path program 1 times [2024-11-22 18:59:17,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:17,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289908079] [2024-11-22 18:59:17,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:17,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:17,933 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 18:59:17,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:17,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289908079] [2024-11-22 18:59:17,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289908079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:59:17,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:59:17,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:59:17,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709966783] [2024-11-22 18:59:17,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:59:17,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:59:17,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:17,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:59:17,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:59:17,937 INFO L87 Difference]: Start difference. First operand 133 states and 142 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 18:59:18,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:18,103 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2024-11-22 18:59:18,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:59:18,103 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-22 18:59:18,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:18,104 INFO L225 Difference]: With dead ends: 132 [2024-11-22 18:59:18,104 INFO L226 Difference]: Without dead ends: 132 [2024-11-22 18:59:18,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:59:18,105 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 7 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:18,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 407 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:59:18,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-22 18:59:18,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-22 18:59:18,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 71 states have (on average 1.9014084507042253) internal successors, (135), 127 states have internal predecessors, (135), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:18,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2024-11-22 18:59:18,110 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 24 [2024-11-22 18:59:18,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:18,111 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2024-11-22 18:59:18,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 18:59:18,111 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2024-11-22 18:59:18,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 18:59:18,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:18,112 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:18,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 18:59:18,112 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 18:59:18,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:18,112 INFO L85 PathProgramCache]: Analyzing trace with hash -29197695, now seen corresponding path program 1 times [2024-11-22 18:59:18,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:18,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82521340] [2024-11-22 18:59:18,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:18,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:18,324 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:59:18,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:18,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82521340] [2024-11-22 18:59:18,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82521340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:59:18,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:59:18,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:59:18,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822057375] [2024-11-22 18:59:18,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:59:18,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:59:18,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:18,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:59:18,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:59:18,328 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 18:59:18,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:18,476 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2024-11-22 18:59:18,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:59:18,476 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-22 18:59:18,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:18,477 INFO L225 Difference]: With dead ends: 131 [2024-11-22 18:59:18,477 INFO L226 Difference]: Without dead ends: 131 [2024-11-22 18:59:18,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:59:18,478 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 6 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:18,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 431 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:59:18,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-22 18:59:18,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-22 18:59:18,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 71 states have (on average 1.8873239436619718) internal successors, (134), 126 states have internal predecessors, (134), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:18,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2024-11-22 18:59:18,484 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 24 [2024-11-22 18:59:18,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:18,485 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2024-11-22 18:59:18,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 18:59:18,485 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2024-11-22 18:59:18,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-22 18:59:18,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:18,486 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:18,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 18:59:18,486 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 18:59:18,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:18,486 INFO L85 PathProgramCache]: Analyzing trace with hash 2005784929, now seen corresponding path program 1 times [2024-11-22 18:59:18,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:18,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716154926] [2024-11-22 18:59:18,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:18,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:18,716 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:59:18,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:18,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716154926] [2024-11-22 18:59:18,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716154926] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:18,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109449715] [2024-11-22 18:59:18,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:18,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:18,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:59:18,722 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:59:18,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 18:59:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:18,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-22 18:59:18,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:59:18,871 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 [2024-11-22 18:59:18,917 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-22 18:59:18,989 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-22 18:59:18,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-22 18:59:19,002 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-22 18:59:19,002 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:59:19,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109449715] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:19,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:59:19,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2024-11-22 18:59:19,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624460322] [2024-11-22 18:59:19,060 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:59:19,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 18:59:19,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:19,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 18:59:19,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2024-11-22 18:59:19,061 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:59:19,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:19,350 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2024-11-22 18:59:19,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:59:19,350 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-11-22 18:59:19,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:19,352 INFO L225 Difference]: With dead ends: 136 [2024-11-22 18:59:19,352 INFO L226 Difference]: Without dead ends: 136 [2024-11-22 18:59:19,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2024-11-22 18:59:19,353 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 2 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:19,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 518 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 434 Invalid, 0 Unknown, 141 Unchecked, 0.2s Time] [2024-11-22 18:59:19,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-22 18:59:19,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-22 18:59:19,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 75 states have (on average 1.8666666666666667) internal successors, (140), 130 states have internal predecessors, (140), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-22 18:59:19,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2024-11-22 18:59:19,357 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 26 [2024-11-22 18:59:19,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:19,358 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2024-11-22 18:59:19,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:59:19,358 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2024-11-22 18:59:19,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-22 18:59:19,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:19,358 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:19,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-22 18:59:19,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-22 18:59:19,560 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 18:59:19,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:19,560 INFO L85 PathProgramCache]: Analyzing trace with hash 2005784930, now seen corresponding path program 1 times [2024-11-22 18:59:19,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:19,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001825175] [2024-11-22 18:59:19,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:19,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:19,886 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:59:19,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:19,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001825175] [2024-11-22 18:59:19,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001825175] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:19,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084938915] [2024-11-22 18:59:19,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:19,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:19,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:59:19,890 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:59:19,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 18:59:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:19,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-22 18:59:19,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:59:20,003 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 [2024-11-22 18:59:20,007 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 [2024-11-22 18:59:20,161 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-22 18:59:20,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:59:20,215 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 [2024-11-22 18:59:20,220 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 18:59:20,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-22 18:59:20,245 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-22 18:59:20,245 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:59:20,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084938915] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:20,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:59:20,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-22 18:59:20,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97603975] [2024-11-22 18:59:20,349 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:59:20,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 18:59:20,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:20,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 18:59:20,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=232, Unknown=1, NotChecked=30, Total=306 [2024-11-22 18:59:20,350 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 16 states, 15 states have (on average 2.8) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 18:59:20,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:20,929 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2024-11-22 18:59:20,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 18:59:20,929 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2024-11-22 18:59:20,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:20,930 INFO L225 Difference]: With dead ends: 136 [2024-11-22 18:59:20,930 INFO L226 Difference]: Without dead ends: 136 [2024-11-22 18:59:20,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=358, Unknown=1, NotChecked=38, Total=462 [2024-11-22 18:59:20,931 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:20,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 926 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 980 Invalid, 0 Unknown, 140 Unchecked, 0.5s Time] [2024-11-22 18:59:20,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-22 18:59:20,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-22 18:59:20,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 130 states have internal predecessors, (139), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-22 18:59:20,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2024-11-22 18:59:20,941 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 26 [2024-11-22 18:59:20,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:20,941 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2024-11-22 18:59:20,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 18:59:20,941 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2024-11-22 18:59:20,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 18:59:20,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:20,942 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:20,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-22 18:59:21,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-22 18:59:21,143 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 18:59:21,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:21,144 INFO L85 PathProgramCache]: Analyzing trace with hash -880845001, now seen corresponding path program 1 times [2024-11-22 18:59:21,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:21,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040288469] [2024-11-22 18:59:21,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:21,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:21,221 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:59:21,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:21,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040288469] [2024-11-22 18:59:21,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040288469] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:21,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146271163] [2024-11-22 18:59:21,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:21,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:21,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:59:21,225 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:59:21,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 18:59:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:21,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-22 18:59:21,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:59:21,320 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 [2024-11-22 18:59:21,408 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-22 18:59:21,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-22 18:59:21,454 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:59:21,454 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:59:21,642 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:59:21,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146271163] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:59:21,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:59:21,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 20 [2024-11-22 18:59:21,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865231810] [2024-11-22 18:59:21,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:59:21,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-22 18:59:21,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:21,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-22 18:59:21,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2024-11-22 18:59:21,644 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 14 states have internal predecessors, (55), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-22 18:59:22,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:22,022 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2024-11-22 18:59:22,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 18:59:22,022 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 14 states have internal predecessors, (55), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 28 [2024-11-22 18:59:22,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:22,023 INFO L225 Difference]: With dead ends: 135 [2024-11-22 18:59:22,023 INFO L226 Difference]: Without dead ends: 135 [2024-11-22 18:59:22,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2024-11-22 18:59:22,023 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 49 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:22,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1186 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:59:22,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-22 18:59:22,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-22 18:59:22,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 75 states have (on average 1.8266666666666667) internal successors, (137), 129 states have internal predecessors, (137), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-22 18:59:22,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions. [2024-11-22 18:59:22,034 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 145 transitions. Word has length 28 [2024-11-22 18:59:22,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:22,034 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 145 transitions. [2024-11-22 18:59:22,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 14 states have internal predecessors, (55), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-22 18:59:22,035 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2024-11-22 18:59:22,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-22 18:59:22,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:22,035 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:22,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 18:59:22,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:22,236 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 18:59:22,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:22,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1541171917, now seen corresponding path program 1 times [2024-11-22 18:59:22,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:22,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906882221] [2024-11-22 18:59:22,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:22,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:22,389 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:59:22,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:22,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906882221] [2024-11-22 18:59:22,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906882221] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:22,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835201940] [2024-11-22 18:59:22,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:22,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:22,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:59:22,392 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:59:22,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 18:59:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:22,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-22 18:59:22,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:59:22,501 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 [2024-11-22 18:59:22,504 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 [2024-11-22 18:59:22,607 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-22 18:59:22,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:59:22,633 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 [2024-11-22 18:59:22,640 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 18:59:22,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-22 18:59:22,666 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-22 18:59:22,666 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:59:22,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835201940] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:22,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:59:22,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2024-11-22 18:59:22,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780575996] [2024-11-22 18:59:22,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:59:22,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-22 18:59:22,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:22,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-22 18:59:22,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2024-11-22 18:59:22,744 INFO L87 Difference]: Start difference. First operand 135 states and 145 transitions. Second operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 18:59:23,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:23,060 INFO L93 Difference]: Finished difference Result 152 states and 167 transitions. [2024-11-22 18:59:23,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 18:59:23,061 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2024-11-22 18:59:23,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:23,064 INFO L225 Difference]: With dead ends: 152 [2024-11-22 18:59:23,064 INFO L226 Difference]: Without dead ends: 152 [2024-11-22 18:59:23,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=316, Unknown=1, NotChecked=36, Total=420 [2024-11-22 18:59:23,064 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 24 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:23,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 767 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 470 Invalid, 0 Unknown, 160 Unchecked, 0.3s Time] [2024-11-22 18:59:23,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-22 18:59:23,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 145. [2024-11-22 18:59:23,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 84 states have (on average 1.7976190476190477) internal successors, (151), 138 states have internal predecessors, (151), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 18:59:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 161 transitions. [2024-11-22 18:59:23,087 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 161 transitions. Word has length 29 [2024-11-22 18:59:23,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:23,087 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 161 transitions. [2024-11-22 18:59:23,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 18:59:23,087 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 161 transitions. [2024-11-22 18:59:23,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-22 18:59:23,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:23,087 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:23,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-22 18:59:23,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:23,292 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 18:59:23,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:23,292 INFO L85 PathProgramCache]: Analyzing trace with hash -531689197, now seen corresponding path program 1 times [2024-11-22 18:59:23,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:23,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896586069] [2024-11-22 18:59:23,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:23,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:23,371 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 18:59:23,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:23,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896586069] [2024-11-22 18:59:23,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896586069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:59:23,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:59:23,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 18:59:23,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609317510] [2024-11-22 18:59:23,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:59:23,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:59:23,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:23,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:59:23,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:59:23,373 INFO L87 Difference]: Start difference. First operand 145 states and 161 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 18:59:23,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:23,540 INFO L93 Difference]: Finished difference Result 144 states and 160 transitions. [2024-11-22 18:59:23,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:59:23,541 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-22 18:59:23,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:23,541 INFO L225 Difference]: With dead ends: 144 [2024-11-22 18:59:23,541 INFO L226 Difference]: Without dead ends: 144 [2024-11-22 18:59:23,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:59:23,542 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 7 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:23,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 462 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:59:23,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-22 18:59:23,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-22 18:59:23,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 84 states have (on average 1.7857142857142858) internal successors, (150), 137 states have internal predecessors, (150), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 18:59:23,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 160 transitions. [2024-11-22 18:59:23,546 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 160 transitions. Word has length 30 [2024-11-22 18:59:23,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:23,546 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 160 transitions. [2024-11-22 18:59:23,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 18:59:23,547 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 160 transitions. [2024-11-22 18:59:23,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-22 18:59:23,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:23,549 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:23,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 18:59:23,551 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 18:59:23,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:23,551 INFO L85 PathProgramCache]: Analyzing trace with hash -531689196, now seen corresponding path program 1 times [2024-11-22 18:59:23,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:23,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494835224] [2024-11-22 18:59:23,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:23,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:23,712 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:59:23,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:23,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494835224] [2024-11-22 18:59:23,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494835224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:59:23,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:59:23,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 18:59:23,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706220325] [2024-11-22 18:59:23,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:59:23,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:59:23,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:23,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:59:23,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:59:23,714 INFO L87 Difference]: Start difference. First operand 144 states and 160 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 18:59:23,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:23,894 INFO L93 Difference]: Finished difference Result 143 states and 159 transitions. [2024-11-22 18:59:23,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:59:23,905 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-22 18:59:23,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:23,906 INFO L225 Difference]: With dead ends: 143 [2024-11-22 18:59:23,906 INFO L226 Difference]: Without dead ends: 143 [2024-11-22 18:59:23,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:59:23,910 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 6 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:23,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 487 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:59:23,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-22 18:59:23,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-22 18:59:23,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 136 states have internal predecessors, (149), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 18:59:23,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 159 transitions. [2024-11-22 18:59:23,913 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 159 transitions. Word has length 30 [2024-11-22 18:59:23,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:23,914 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 159 transitions. [2024-11-22 18:59:23,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 18:59:23,914 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 159 transitions. [2024-11-22 18:59:23,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-22 18:59:23,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:23,915 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:23,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 18:59:23,915 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 18:59:23,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:23,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1880683964, now seen corresponding path program 1 times [2024-11-22 18:59:23,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:23,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114068060] [2024-11-22 18:59:23,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:23,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:24,005 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-22 18:59:24,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:24,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114068060] [2024-11-22 18:59:24,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114068060] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:24,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643454954] [2024-11-22 18:59:24,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:24,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:24,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:59:24,008 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:59:24,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 18:59:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:24,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 18:59:24,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:59:24,149 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-22 18:59:24,149 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:59:24,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643454954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:59:24,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 18:59:24,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-22 18:59:24,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308149715] [2024-11-22 18:59:24,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:59:24,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:59:24,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:24,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:59:24,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:59:24,151 INFO L87 Difference]: Start difference. First operand 143 states and 159 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:59:24,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:24,163 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2024-11-22 18:59:24,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:59:24,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2024-11-22 18:59:24,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:24,164 INFO L225 Difference]: With dead ends: 125 [2024-11-22 18:59:24,164 INFO L226 Difference]: Without dead ends: 125 [2024-11-22 18:59:24,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:59:24,164 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:24,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 374 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:59:24,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-22 18:59:24,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-22 18:59:24,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 71 states have (on average 1.7746478873239437) internal successors, (126), 120 states have internal predecessors, (126), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:24,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2024-11-22 18:59:24,167 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 41 [2024-11-22 18:59:24,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:24,167 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2024-11-22 18:59:24,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:59:24,167 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2024-11-22 18:59:24,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-22 18:59:24,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:24,168 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:24,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-22 18:59:24,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-22 18:59:24,368 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 18:59:24,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:24,369 INFO L85 PathProgramCache]: Analyzing trace with hash -837194340, now seen corresponding path program 1 times [2024-11-22 18:59:24,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:24,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119894934] [2024-11-22 18:59:24,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:24,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:24,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:24,732 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 18:59:24,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:24,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119894934] [2024-11-22 18:59:24,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119894934] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:24,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710531534] [2024-11-22 18:59:24,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:24,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:24,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:59:24,733 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:59:24,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 18:59:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:24,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-22 18:59:24,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:59:24,865 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 [2024-11-22 18:59:24,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-22 18:59:24,907 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-22 18:59:24,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-22 18:59:24,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-22 18:59:24,972 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-11-22 18:59:25,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:59:25,009 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 18 treesize of output 13 [2024-11-22 18:59:25,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-22 18:59:25,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:59:25,100 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 [2024-11-22 18:59:25,108 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 14 not checked. [2024-11-22 18:59:25,108 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:59:25,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710531534] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:25,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:59:25,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2024-11-22 18:59:25,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251036134] [2024-11-22 18:59:25,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:59:25,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-22 18:59:25,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:25,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-22 18:59:25,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=257, Unknown=1, NotChecked=32, Total=342 [2024-11-22 18:59:25,157 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand has 18 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-22 18:59:25,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:25,531 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2024-11-22 18:59:25,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:59:25,532 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2024-11-22 18:59:25,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:25,532 INFO L225 Difference]: With dead ends: 135 [2024-11-22 18:59:25,532 INFO L226 Difference]: Without dead ends: 135 [2024-11-22 18:59:25,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=346, Unknown=1, NotChecked=38, Total=462 [2024-11-22 18:59:25,533 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 201 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:25,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 443 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 596 Invalid, 0 Unknown, 136 Unchecked, 0.3s Time] [2024-11-22 18:59:25,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-22 18:59:25,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 117. [2024-11-22 18:59:25,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 71 states have (on average 1.6619718309859155) internal successors, (118), 112 states have internal predecessors, (118), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2024-11-22 18:59:25,535 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 43 [2024-11-22 18:59:25,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:25,536 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2024-11-22 18:59:25,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-22 18:59:25,536 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2024-11-22 18:59:25,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-22 18:59:25,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:25,536 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:25,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-22 18:59:25,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:25,737 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 18:59:25,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:25,738 INFO L85 PathProgramCache]: Analyzing trace with hash -837194339, now seen corresponding path program 1 times [2024-11-22 18:59:25,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:25,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887841198] [2024-11-22 18:59:25,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:25,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:26,222 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:59:26,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:26,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887841198] [2024-11-22 18:59:26,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887841198] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:26,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066160830] [2024-11-22 18:59:26,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:26,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:26,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:59:26,225 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:59:26,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-22 18:59:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:26,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-22 18:59:26,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:59:26,368 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 [2024-11-22 18:59:26,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-22 18:59:26,392 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-22 18:59:26,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:59:26,430 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 [2024-11-22 18:59:26,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-22 18:59:26,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:59:26,473 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 [2024-11-22 18:59:26,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-22 18:59:26,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:59:26,569 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 [2024-11-22 18:59:26,574 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-22 18:59:26,574 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:59:26,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066160830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:59:26,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 18:59:26,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 15 [2024-11-22 18:59:26,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539907783] [2024-11-22 18:59:26,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:59:26,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:59:26,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:26,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:59:26,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=168, Unknown=1, NotChecked=26, Total=240 [2024-11-22 18:59:26,575 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:59:26,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:26,695 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2024-11-22 18:59:26,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:59:26,696 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2024-11-22 18:59:26,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:26,696 INFO L225 Difference]: With dead ends: 112 [2024-11-22 18:59:26,696 INFO L226 Difference]: Without dead ends: 112 [2024-11-22 18:59:26,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=192, Unknown=1, NotChecked=28, Total=272 [2024-11-22 18:59:26,697 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 11 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:26,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 324 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 200 Invalid, 0 Unknown, 151 Unchecked, 0.1s Time] [2024-11-22 18:59:26,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-22 18:59:26,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-22 18:59:26,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 71 states have (on average 1.591549295774648) internal successors, (113), 107 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:26,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2024-11-22 18:59:26,699 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 43 [2024-11-22 18:59:26,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:26,700 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2024-11-22 18:59:26,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:59:26,700 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2024-11-22 18:59:26,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-22 18:59:26,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:26,700 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:26,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-22 18:59:26,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:26,902 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 18:59:26,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:26,902 INFO L85 PathProgramCache]: Analyzing trace with hash 18522841, now seen corresponding path program 1 times [2024-11-22 18:59:26,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:26,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178088818] [2024-11-22 18:59:26,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:26,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:27,007 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-22 18:59:27,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:27,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178088818] [2024-11-22 18:59:27,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178088818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:59:27,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:59:27,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:59:27,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376623659] [2024-11-22 18:59:27,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:59:27,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:59:27,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:27,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:59:27,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:59:27,009 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-22 18:59:27,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:27,137 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2024-11-22 18:59:27,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:59:27,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-11-22 18:59:27,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:27,138 INFO L225 Difference]: With dead ends: 108 [2024-11-22 18:59:27,138 INFO L226 Difference]: Without dead ends: 108 [2024-11-22 18:59:27,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:59:27,140 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 18 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:27,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 314 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:59:27,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-22 18:59:27,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-22 18:59:27,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 71 states have (on average 1.5352112676056338) internal successors, (109), 103 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:27,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2024-11-22 18:59:27,142 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 46 [2024-11-22 18:59:27,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:27,142 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2024-11-22 18:59:27,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-22 18:59:27,143 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2024-11-22 18:59:27,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-22 18:59:27,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:27,144 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:27,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 18:59:27,145 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 18:59:27,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:27,145 INFO L85 PathProgramCache]: Analyzing trace with hash 18522842, now seen corresponding path program 1 times [2024-11-22 18:59:27,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:27,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033712435] [2024-11-22 18:59:27,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:27,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:27,303 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-22 18:59:27,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:27,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033712435] [2024-11-22 18:59:27,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033712435] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:27,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138686406] [2024-11-22 18:59:27,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:27,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:27,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:59:27,306 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:59:27,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-22 18:59:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:27,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-22 18:59:27,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:59:27,464 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 [2024-11-22 18:59:27,528 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-22 18:59:27,528 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:59:27,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138686406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:59:27,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 18:59:27,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2024-11-22 18:59:27,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011470061] [2024-11-22 18:59:27,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:59:27,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:59:27,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:27,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:59:27,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-11-22 18:59:27,530 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-22 18:59:27,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:27,643 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2024-11-22 18:59:27,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:59:27,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-11-22 18:59:27,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:27,644 INFO L225 Difference]: With dead ends: 104 [2024-11-22 18:59:27,644 INFO L226 Difference]: Without dead ends: 104 [2024-11-22 18:59:27,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-11-22 18:59:27,645 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 17 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:27,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 326 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:59:27,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-22 18:59:27,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-22 18:59:27,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 71 states have (on average 1.4788732394366197) internal successors, (105), 99 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:27,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2024-11-22 18:59:27,647 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 46 [2024-11-22 18:59:27,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:27,647 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2024-11-22 18:59:27,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-22 18:59:27,647 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2024-11-22 18:59:27,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-22 18:59:27,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:27,648 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:27,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-22 18:59:27,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-22 18:59:27,852 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 18:59:27,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:27,852 INFO L85 PathProgramCache]: Analyzing trace with hash 18533764, now seen corresponding path program 1 times [2024-11-22 18:59:27,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:27,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460774819] [2024-11-22 18:59:27,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:27,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:28,157 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:59:28,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:28,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460774819] [2024-11-22 18:59:28,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460774819] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:28,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063497573] [2024-11-22 18:59:28,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:28,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:28,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:59:28,160 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:59:28,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-22 18:59:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:28,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-22 18:59:28,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:59:28,692 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 9 treesize of output 3 [2024-11-22 18:59:28,698 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-22 18:59:28,727 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-22 18:59:28,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2024-11-22 18:59:28,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-22 18:59:28,741 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-22 18:59:28,741 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:59:28,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063497573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:59:28,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 18:59:28,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 19 [2024-11-22 18:59:28,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713568404] [2024-11-22 18:59:28,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:59:28,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 18:59:28,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:28,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 18:59:28,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=296, Unknown=1, NotChecked=34, Total=380 [2024-11-22 18:59:28,742 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:59:28,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:28,908 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2024-11-22 18:59:28,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 18:59:28,909 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2024-11-22 18:59:28,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:28,909 INFO L225 Difference]: With dead ends: 103 [2024-11-22 18:59:28,909 INFO L226 Difference]: Without dead ends: 103 [2024-11-22 18:59:28,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=364, Unknown=1, NotChecked=38, Total=462 [2024-11-22 18:59:28,910 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 8 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:28,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 465 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 312 Invalid, 0 Unknown, 167 Unchecked, 0.1s Time] [2024-11-22 18:59:28,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-22 18:59:28,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-22 18:59:28,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 98 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:28,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2024-11-22 18:59:28,912 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 46 [2024-11-22 18:59:28,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:28,912 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2024-11-22 18:59:28,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:59:28,912 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2024-11-22 18:59:28,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-22 18:59:28,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:28,913 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:28,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-22 18:59:29,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-22 18:59:29,117 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 18:59:29,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:29,117 INFO L85 PathProgramCache]: Analyzing trace with hash 18533765, now seen corresponding path program 1 times [2024-11-22 18:59:29,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:29,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765160510] [2024-11-22 18:59:29,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:29,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:29,478 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:59:29,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:29,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765160510] [2024-11-22 18:59:29,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765160510] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:29,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110536717] [2024-11-22 18:59:29,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:29,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:29,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:59:29,481 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:59:29,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-22 18:59:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:29,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-22 18:59:29,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:59:29,918 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 [2024-11-22 18:59:29,921 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 [2024-11-22 18:59:30,094 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-22 18:59:30,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-22 18:59:30,106 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 18:59:30,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-22 18:59:30,363 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 15 treesize of output 7 [2024-11-22 18:59:30,366 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 15 treesize of output 7 [2024-11-22 18:59:30,396 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2024-11-22 18:59:30,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:59:30,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:59:30,431 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-11-22 18:59:30,441 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-22 18:59:30,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-22 18:59:30,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-22 18:59:30,541 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2024-11-22 18:59:30,541 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:59:30,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110536717] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:30,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:59:30,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19] total 31 [2024-11-22 18:59:30,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211191180] [2024-11-22 18:59:30,670 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:59:30,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-22 18:59:30,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:30,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-22 18:59:30,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1016, Unknown=1, NotChecked=64, Total=1190 [2024-11-22 18:59:30,671 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand has 32 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 26 states have internal predecessors, (79), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:59:31,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:31,255 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2024-11-22 18:59:31,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-22 18:59:31,256 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 26 states have internal predecessors, (79), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 46 [2024-11-22 18:59:31,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:31,257 INFO L225 Difference]: With dead ends: 110 [2024-11-22 18:59:31,257 INFO L226 Difference]: Without dead ends: 110 [2024-11-22 18:59:31,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=1266, Unknown=1, NotChecked=72, Total=1482 [2024-11-22 18:59:31,257 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 67 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:31,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 917 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1057 Invalid, 0 Unknown, 109 Unchecked, 0.5s Time] [2024-11-22 18:59:31,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-22 18:59:31,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-22 18:59:31,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 104 states have internal predecessors, (110), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:31,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 116 transitions. [2024-11-22 18:59:31,260 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 116 transitions. Word has length 46 [2024-11-22 18:59:31,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:31,260 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 116 transitions. [2024-11-22 18:59:31,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 26 states have internal predecessors, (79), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:59:31,260 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2024-11-22 18:59:31,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-22 18:59:31,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:31,260 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:31,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-22 18:59:31,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-22 18:59:31,461 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 18:59:31,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:31,461 INFO L85 PathProgramCache]: Analyzing trace with hash 2058168226, now seen corresponding path program 1 times [2024-11-22 18:59:31,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:31,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472847284] [2024-11-22 18:59:31,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:31,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:31,657 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-22 18:59:31,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:31,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472847284] [2024-11-22 18:59:31,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472847284] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:31,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603190159] [2024-11-22 18:59:31,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:31,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:31,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:59:31,660 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:59:31,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-22 18:59:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:31,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-22 18:59:31,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:59:31,826 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 [2024-11-22 18:59:31,840 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 [2024-11-22 18:59:31,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-22 18:59:31,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-22 18:59:31,938 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-22 18:59:31,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-22 18:59:31,953 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 18:59:31,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-22 18:59:32,029 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 11 treesize of output 7 [2024-11-22 18:59:32,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-22 18:59:32,038 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-22 18:59:32,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:59:32,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-22 18:59:32,083 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-22 18:59:32,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-22 18:59:32,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-22 18:59:32,154 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-22 18:59:32,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:59:32,185 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 [2024-11-22 18:59:32,212 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 21 not checked. [2024-11-22 18:59:32,213 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:59:32,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603190159] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:32,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:59:32,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 21 [2024-11-22 18:59:32,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346483205] [2024-11-22 18:59:32,294 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:59:32,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-22 18:59:32,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:32,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-22 18:59:32,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=362, Unknown=2, NotChecked=78, Total=506 [2024-11-22 18:59:32,295 INFO L87 Difference]: Start difference. First operand 110 states and 116 transitions. Second operand has 21 states, 20 states have (on average 3.9) internal successors, (78), 17 states have internal predecessors, (78), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:59:32,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:32,731 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2024-11-22 18:59:32,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 18:59:32,732 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.9) internal successors, (78), 17 states have internal predecessors, (78), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2024-11-22 18:59:32,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:32,732 INFO L225 Difference]: With dead ends: 104 [2024-11-22 18:59:32,732 INFO L226 Difference]: Without dead ends: 104 [2024-11-22 18:59:32,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=690, Unknown=2, NotChecked=110, Total=930 [2024-11-22 18:59:32,733 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 108 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 190 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:32,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 643 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 644 Invalid, 0 Unknown, 190 Unchecked, 0.3s Time] [2024-11-22 18:59:32,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-22 18:59:32,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-22 18:59:32,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 98 states have internal predecessors, (103), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:32,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2024-11-22 18:59:32,737 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 49 [2024-11-22 18:59:32,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:32,738 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2024-11-22 18:59:32,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.9) internal successors, (78), 17 states have internal predecessors, (78), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:59:32,738 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2024-11-22 18:59:32,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-22 18:59:32,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:32,739 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:32,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-22 18:59:32,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:32,943 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 18:59:32,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:32,944 INFO L85 PathProgramCache]: Analyzing trace with hash 692995273, now seen corresponding path program 1 times [2024-11-22 18:59:32,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:32,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938974837] [2024-11-22 18:59:32,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:32,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:33,024 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-22 18:59:33,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:33,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938974837] [2024-11-22 18:59:33,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938974837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:59:33,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:59:33,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:59:33,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527637087] [2024-11-22 18:59:33,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:59:33,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:59:33,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:33,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:59:33,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:59:33,027 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-22 18:59:33,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:33,107 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2024-11-22 18:59:33,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:59:33,108 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-11-22 18:59:33,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:33,108 INFO L225 Difference]: With dead ends: 103 [2024-11-22 18:59:33,108 INFO L226 Difference]: Without dead ends: 103 [2024-11-22 18:59:33,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:59:33,109 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 2 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:33,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 346 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:59:33,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-22 18:59:33,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-22 18:59:33,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.36) internal successors, (102), 97 states have internal predecessors, (102), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:33,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2024-11-22 18:59:33,111 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 52 [2024-11-22 18:59:33,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:33,112 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2024-11-22 18:59:33,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-22 18:59:33,112 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2024-11-22 18:59:33,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-22 18:59:33,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:33,112 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:33,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-22 18:59:33,112 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 18:59:33,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:33,113 INFO L85 PathProgramCache]: Analyzing trace with hash 692995274, now seen corresponding path program 1 times [2024-11-22 18:59:33,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:33,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020322666] [2024-11-22 18:59:33,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:33,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:33,376 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-22 18:59:33,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:33,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020322666] [2024-11-22 18:59:33,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020322666] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:33,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716671109] [2024-11-22 18:59:33,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:33,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:33,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:59:33,378 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:59:33,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-22 18:59:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:33,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-22 18:59:33,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:59:33,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-22 18:59:33,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2024-11-22 18:59:33,637 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-22 18:59:33,637 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:59:33,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716671109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:59:33,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 18:59:33,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2024-11-22 18:59:33,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563938706] [2024-11-22 18:59:33,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:59:33,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:59:33,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:33,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:59:33,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2024-11-22 18:59:33,639 INFO L87 Difference]: Start difference. First operand 103 states and 108 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-22 18:59:33,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:33,724 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2024-11-22 18:59:33,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:59:33,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-11-22 18:59:33,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:33,725 INFO L225 Difference]: With dead ends: 102 [2024-11-22 18:59:33,725 INFO L226 Difference]: Without dead ends: 102 [2024-11-22 18:59:33,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2024-11-22 18:59:33,726 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 2 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:33,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 364 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:59:33,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-22 18:59:33,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-22 18:59:33,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 96 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:33,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2024-11-22 18:59:33,729 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 52 [2024-11-22 18:59:33,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:33,729 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2024-11-22 18:59:33,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-22 18:59:33,730 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2024-11-22 18:59:33,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-22 18:59:33,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:33,730 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:33,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-22 18:59:33,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-22 18:59:33,931 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 18:59:33,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:33,931 INFO L85 PathProgramCache]: Analyzing trace with hash 8017033, now seen corresponding path program 1 times [2024-11-22 18:59:33,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:33,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76021113] [2024-11-22 18:59:33,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:33,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:34,662 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:59:34,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:34,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76021113] [2024-11-22 18:59:34,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76021113] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:34,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852635134] [2024-11-22 18:59:34,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:34,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:34,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:59:34,665 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:59:34,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-22 18:59:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:34,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-22 18:59:34,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:59:34,866 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 [2024-11-22 18:59:34,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 18:59:34,956 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 13 treesize of output 5 [2024-11-22 18:59:34,960 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-22 18:59:34,961 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 15 treesize of output 7 [2024-11-22 18:59:35,071 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0))) is different from true [2024-11-22 18:59:35,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:59:35,088 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 22 treesize of output 17 [2024-11-22 18:59:35,106 INFO L349 Elim1Store]: treesize reduction 92, result has 31.9 percent of original size [2024-11-22 18:59:35,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 57 [2024-11-22 18:59:35,208 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-22 18:59:35,209 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 15 treesize of output 7 [2024-11-22 18:59:35,253 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 37 treesize of output 13 [2024-11-22 18:59:35,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-22 18:59:35,435 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2024-11-22 18:59:35,436 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:59:35,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852635134] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:35,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:59:35,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 33 [2024-11-22 18:59:35,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075436187] [2024-11-22 18:59:35,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:59:35,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-22 18:59:35,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:35,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-22 18:59:35,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1157, Unknown=1, NotChecked=68, Total=1332 [2024-11-22 18:59:35,558 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand has 34 states, 32 states have (on average 2.4375) internal successors, (78), 30 states have internal predecessors, (78), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-22 18:59:36,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:36,391 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2024-11-22 18:59:36,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-22 18:59:36,393 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 2.4375) internal successors, (78), 30 states have internal predecessors, (78), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 53 [2024-11-22 18:59:36,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:36,393 INFO L225 Difference]: With dead ends: 101 [2024-11-22 18:59:36,393 INFO L226 Difference]: Without dead ends: 101 [2024-11-22 18:59:36,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=190, Invalid=1883, Unknown=1, NotChecked=88, Total=2162 [2024-11-22 18:59:36,394 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 15 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:36,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 930 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1044 Invalid, 0 Unknown, 103 Unchecked, 0.5s Time] [2024-11-22 18:59:36,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-22 18:59:36,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-22 18:59:36,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 95 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:36,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2024-11-22 18:59:36,396 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 53 [2024-11-22 18:59:36,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:36,397 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2024-11-22 18:59:36,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 2.4375) internal successors, (78), 30 states have internal predecessors, (78), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-22 18:59:36,397 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2024-11-22 18:59:36,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-22 18:59:36,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:36,398 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:36,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-22 18:59:36,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-22 18:59:36,598 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 18:59:36,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:36,599 INFO L85 PathProgramCache]: Analyzing trace with hash 8017034, now seen corresponding path program 1 times [2024-11-22 18:59:36,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:36,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183062198] [2024-11-22 18:59:36,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:36,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:38,329 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:59:38,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:38,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183062198] [2024-11-22 18:59:38,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183062198] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:38,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365992956] [2024-11-22 18:59:38,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:38,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:38,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:59:38,330 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:59:38,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-22 18:59:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:38,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 102 conjuncts are in the unsatisfiable core [2024-11-22 18:59:38,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:59:38,529 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 [2024-11-22 18:59:38,532 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 [2024-11-22 18:59:38,776 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-22 18:59:38,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-22 18:59:38,786 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 18:59:38,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-22 18:59:38,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 18:59:38,962 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 13 treesize of output 9 [2024-11-22 18:59:39,131 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 61 treesize of output 19 [2024-11-22 18:59:39,135 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 17 treesize of output 3 [2024-11-22 18:59:39,139 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 15 treesize of output 7 [2024-11-22 18:59:39,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-22 18:59:39,290 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))))) is different from true [2024-11-22 18:59:39,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:59:39,311 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 69 treesize of output 52 [2024-11-22 18:59:39,329 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-22 18:59:39,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-11-22 18:59:39,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2024-11-22 18:59:39,340 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 26 treesize of output 21 [2024-11-22 18:59:39,410 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 66 treesize of output 50 [2024-11-22 18:59:39,459 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 47 treesize of output 17 [2024-11-22 18:59:39,464 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 13 treesize of output 3 [2024-11-22 18:59:39,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-22 18:59:39,581 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-22 18:59:39,581 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:59:39,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365992956] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:39,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:59:39,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25] total 50 [2024-11-22 18:59:39,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224386361] [2024-11-22 18:59:39,923 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:59:39,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-22 18:59:39,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:39,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-22 18:59:39,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2815, Unknown=1, NotChecked=106, Total=3080 [2024-11-22 18:59:39,924 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 51 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 44 states have internal predecessors, (91), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:59:41,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:41,531 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2024-11-22 18:59:41,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-22 18:59:41,532 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 44 states have internal predecessors, (91), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 53 [2024-11-22 18:59:41,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:41,532 INFO L225 Difference]: With dead ends: 100 [2024-11-22 18:59:41,532 INFO L226 Difference]: Without dead ends: 100 [2024-11-22 18:59:41,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 956 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=300, Invalid=4959, Unknown=1, NotChecked=142, Total=5402 [2024-11-22 18:59:41,533 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 26 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 1945 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 2048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:41,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1681 Invalid, 2048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1945 Invalid, 0 Unknown, 95 Unchecked, 0.8s Time] [2024-11-22 18:59:41,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-22 18:59:41,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-22 18:59:41,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 75 states have (on average 1.32) internal successors, (99), 94 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:41,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2024-11-22 18:59:41,536 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 53 [2024-11-22 18:59:41,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:41,536 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2024-11-22 18:59:41,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 44 states have internal predecessors, (91), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:59:41,536 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2024-11-22 18:59:41,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-22 18:59:41,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:41,537 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:41,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-22 18:59:41,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:41,737 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 18:59:41,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:41,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1967278510, now seen corresponding path program 1 times [2024-11-22 18:59:41,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:41,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298089589] [2024-11-22 18:59:41,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:41,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:41,944 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-22 18:59:41,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:41,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298089589] [2024-11-22 18:59:41,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298089589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:59:41,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:59:41,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 18:59:41,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858972014] [2024-11-22 18:59:41,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:59:41,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 18:59:41,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:41,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 18:59:41,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-22 18:59:41,946 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 10 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:59:42,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:42,148 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2024-11-22 18:59:42,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 18:59:42,149 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-11-22 18:59:42,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:42,150 INFO L225 Difference]: With dead ends: 101 [2024-11-22 18:59:42,150 INFO L226 Difference]: Without dead ends: 101 [2024-11-22 18:59:42,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-22 18:59:42,150 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 37 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:42,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 387 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:59:42,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-22 18:59:42,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2024-11-22 18:59:42,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.28) internal successors, (96), 91 states have internal predecessors, (96), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:42,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2024-11-22 18:59:42,160 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 59 [2024-11-22 18:59:42,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:42,160 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2024-11-22 18:59:42,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:59:42,161 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2024-11-22 18:59:42,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-22 18:59:42,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:42,161 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:42,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-22 18:59:42,161 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 18:59:42,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:42,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1967278511, now seen corresponding path program 1 times [2024-11-22 18:59:42,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:42,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445808751] [2024-11-22 18:59:42,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:42,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:42,522 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-22 18:59:42,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:42,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445808751] [2024-11-22 18:59:42,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445808751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:59:42,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:59:42,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 18:59:42,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806311926] [2024-11-22 18:59:42,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:59:42,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 18:59:42,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:42,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 18:59:42,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-22 18:59:42,524 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 12 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:59:42,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:42,673 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2024-11-22 18:59:42,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 18:59:42,674 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-11-22 18:59:42,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:42,674 INFO L225 Difference]: With dead ends: 99 [2024-11-22 18:59:42,674 INFO L226 Difference]: Without dead ends: 99 [2024-11-22 18:59:42,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-22 18:59:42,675 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 35 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:42,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 439 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:59:42,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-22 18:59:42,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2024-11-22 18:59:42,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 89 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:42,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2024-11-22 18:59:42,677 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 59 [2024-11-22 18:59:42,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:42,677 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2024-11-22 18:59:42,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:59:42,677 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2024-11-22 18:59:42,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-22 18:59:42,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:42,678 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:42,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-22 18:59:42,678 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 18:59:42,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:42,678 INFO L85 PathProgramCache]: Analyzing trace with hash 313194049, now seen corresponding path program 1 times [2024-11-22 18:59:42,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:42,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334368301] [2024-11-22 18:59:42,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:42,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:44,432 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 18:59:44,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:44,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334368301] [2024-11-22 18:59:44,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334368301] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:44,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245836662] [2024-11-22 18:59:44,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:44,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:44,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:59:44,434 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:59:44,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-22 18:59:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:44,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-22 18:59:44,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:59:44,676 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 [2024-11-22 18:59:44,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 18:59:44,974 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 13 treesize of output 5 [2024-11-22 18:59:44,994 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-22 18:59:44,994 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 15 treesize of output 7 [2024-11-22 18:59:45,148 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 13 treesize of output 9 [2024-11-22 18:59:45,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:59:45,266 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 22 treesize of output 17 [2024-11-22 18:59:45,276 INFO L349 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2024-11-22 18:59:45,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2024-11-22 18:59:45,625 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:59:45,626 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:59:45,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 8 [2024-11-22 18:59:45,965 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:59:45,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-22 18:59:45,970 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:59:45,982 INFO L349 Elim1Store]: treesize reduction 29, result has 34.1 percent of original size [2024-11-22 18:59:45,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 29 [2024-11-22 18:59:46,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:59:46,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-22 18:59:46,065 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 18 treesize of output 13 [2024-11-22 18:59:46,117 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 18 treesize of output 13 [2024-11-22 18:59:46,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 21 [2024-11-22 18:59:46,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-22 18:59:46,214 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 21 treesize of output 13 [2024-11-22 18:59:46,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-22 18:59:46,286 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:59:46,286 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:59:46,418 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3243 (Array Int Int)) (v_ArrVal_3244 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3243))) (or (not (= v_ArrVal_3244 (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 (select v_ArrVal_3244 .cse1))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3244) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2024-11-22 18:59:46,427 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3242 (Array Int Int)) (v_ArrVal_3243 (Array Int Int)) (v_ArrVal_3244 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_3242) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3243))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3244) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 (select v_ArrVal_3244 .cse1))) v_ArrVal_3244))))) is different from false [2024-11-22 18:59:46,437 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3242 (Array Int Int)) (v_ArrVal_3243 (Array Int Int)) (v_ArrVal_3244 (Array Int Int)) (v_ArrVal_3239 Int)) (or (not (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3239)) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_3242) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3243) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse0 (select v_ArrVal_3244 .cse0))) v_ArrVal_3244)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_3242) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3243) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3244) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2024-11-22 18:59:46,449 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3242 (Array Int Int)) (v_ArrVal_3243 (Array Int Int)) (v_ArrVal_3244 (Array Int Int)) (v_ArrVal_3239 Int)) (or (not (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3239)) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_3242) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3243) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse0 (select v_ArrVal_3244 .cse0))) v_ArrVal_3244)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_3242) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3243) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3244) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2024-11-22 18:59:46,461 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3242 (Array Int Int)) (v_ArrVal_3243 (Array Int Int)) (v_ArrVal_3244 (Array Int Int)) (v_ArrVal_3239 Int)) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_3242) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3243) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3244) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_3244 (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3239)) |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_3242) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3243) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse0 (select v_ArrVal_3244 .cse0))))))) is different from false [2024-11-22 18:59:46,475 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3242 (Array Int Int)) (v_ArrVal_3243 (Array Int Int)) (v_ArrVal_3244 (Array Int Int)) (v_ArrVal_3239 Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (or (not (= (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3239)) .cse0 v_ArrVal_3242) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3243) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 (select v_ArrVal_3244 .cse1))) v_ArrVal_3244)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_3242) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3243) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3244) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2024-11-22 18:59:46,487 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3242 (Array Int Int)) (v_ArrVal_3243 (Array Int Int)) (v_ArrVal_3244 (Array Int Int)) (v_ArrVal_3239 Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_3242) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_3243) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3244) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= v_ArrVal_3244 (let ((.cse2 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3239)) .cse0 v_ArrVal_3242) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_3243) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse2 (select v_ArrVal_3244 .cse2))))))))) is different from false [2024-11-22 18:59:46,512 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3242 (Array Int Int)) (v_ArrVal_3243 (Array Int Int)) (v_ArrVal_3244 (Array Int Int)) (v_ArrVal_3239 Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.offset| 4)))) (or (= (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_3242) .cse1 v_ArrVal_3243) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3244) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_3244 (let ((.cse3 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3239)) .cse0 v_ArrVal_3242) .cse1 v_ArrVal_3243) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse3 (select v_ArrVal_3244 .cse3))))))))) is different from false [2024-11-22 18:59:46,525 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3242 (Array Int Int)) (v_ArrVal_3243 (Array Int Int)) (v_ArrVal_3244 (Array Int Int)) (v_ArrVal_3239 Int)) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse4 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (or (not (= v_ArrVal_3244 (let ((.cse2 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4))) (store (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3239)) .cse0 v_ArrVal_3242) .cse1 v_ArrVal_3243) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse2 (select v_ArrVal_3244 .cse2))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_3242) .cse1 v_ArrVal_3243) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3244) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) is different from false [2024-11-22 18:59:46,845 INFO L349 Elim1Store]: treesize reduction 167, result has 42.2 percent of original size [2024-11-22 18:59:46,846 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 3 case distinctions, treesize of input 1177 treesize of output 1225 [2024-11-22 18:59:46,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:59:46,876 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 1371 treesize of output 1367 [2024-11-22 18:59:46,887 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 1538 treesize of output 1378 [2024-11-22 18:59:46,905 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 1522 treesize of output 1442 [2024-11-22 18:59:46,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 4 [2024-11-22 18:59:47,494 INFO L349 Elim1Store]: treesize reduction 12, result has 78.9 percent of original size [2024-11-22 18:59:47,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 436 treesize of output 436 [2024-11-22 18:59:47,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245836662] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:47,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:59:47,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 58 [2024-11-22 18:59:47,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537467944] [2024-11-22 18:59:47,991 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:59:47,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-22 18:59:47,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:47,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-22 18:59:47,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=3701, Unknown=20, NotChecked=1170, Total=5112 [2024-11-22 18:59:47,993 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand has 58 states, 56 states have (on average 1.8214285714285714) internal successors, (102), 52 states have internal predecessors, (102), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-22 18:59:49,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:49,838 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2024-11-22 18:59:49,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-22 18:59:49,838 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 56 states have (on average 1.8214285714285714) internal successors, (102), 52 states have internal predecessors, (102), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 63 [2024-11-22 18:59:49,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:49,839 INFO L225 Difference]: With dead ends: 95 [2024-11-22 18:59:49,839 INFO L226 Difference]: Without dead ends: 95 [2024-11-22 18:59:49,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1483 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=421, Invalid=6905, Unknown=20, NotChecked=1584, Total=8930 [2024-11-22 18:59:49,842 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 38 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 1966 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:49,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1870 Invalid, 1970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1966 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-22 18:59:49,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-22 18:59:49,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-22 18:59:49,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.24) internal successors, (93), 89 states have internal predecessors, (93), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:49,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2024-11-22 18:59:49,844 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 63 [2024-11-22 18:59:49,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:49,844 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2024-11-22 18:59:49,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 56 states have (on average 1.8214285714285714) internal successors, (102), 52 states have internal predecessors, (102), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-22 18:59:49,844 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2024-11-22 18:59:49,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-22 18:59:49,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:49,845 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:49,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-22 18:59:50,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-22 18:59:50,045 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 18:59:50,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:50,045 INFO L85 PathProgramCache]: Analyzing trace with hash 313174131, now seen corresponding path program 1 times [2024-11-22 18:59:50,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:50,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570100730] [2024-11-22 18:59:50,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:50,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:51,146 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 18:59:51,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:51,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570100730] [2024-11-22 18:59:51,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570100730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:59:51,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:59:51,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2024-11-22 18:59:51,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461075307] [2024-11-22 18:59:51,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:59:51,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-22 18:59:51,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:51,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-22 18:59:51,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=747, Unknown=0, NotChecked=0, Total=812 [2024-11-22 18:59:51,148 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand has 29 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:59:51,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:59:51,721 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2024-11-22 18:59:51,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-22 18:59:51,721 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 63 [2024-11-22 18:59:51,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:59:51,722 INFO L225 Difference]: With dead ends: 100 [2024-11-22 18:59:51,722 INFO L226 Difference]: Without dead ends: 100 [2024-11-22 18:59:51,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=1291, Unknown=0, NotChecked=0, Total=1406 [2024-11-22 18:59:51,722 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 40 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:59:51,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 910 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 18:59:51,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-22 18:59:51,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2024-11-22 18:59:51,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.25) internal successors, (95), 90 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:59:51,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2024-11-22 18:59:51,724 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 63 [2024-11-22 18:59:51,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:59:51,724 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2024-11-22 18:59:51,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:59:51,725 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2024-11-22 18:59:51,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-22 18:59:51,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:59:51,725 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:59:51,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-22 18:59:51,725 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 18:59:51,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:59:51,725 INFO L85 PathProgramCache]: Analyzing trace with hash 313174132, now seen corresponding path program 1 times [2024-11-22 18:59:51,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:59:51,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943761406] [2024-11-22 18:59:51,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:51,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:59:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:59:53,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:59:53,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943761406] [2024-11-22 18:59:53,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943761406] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:53,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75133316] [2024-11-22 18:59:53,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:59:53,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:59:53,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:59:53,620 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:59:53,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-22 18:59:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:59:53,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 115 conjuncts are in the unsatisfiable core [2024-11-22 18:59:53,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:59:53,861 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 [2024-11-22 18:59:54,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 18:59:54,188 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 13 treesize of output 5 [2024-11-22 18:59:54,192 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-22 18:59:54,192 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 15 treesize of output 7 [2024-11-22 18:59:54,194 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 9 treesize of output 3 [2024-11-22 18:59:54,475 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-22 18:59:54,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-22 18:59:54,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:59:54,483 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 22 treesize of output 17 [2024-11-22 18:59:54,501 INFO L349 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2024-11-22 18:59:54,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2024-11-22 18:59:55,259 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:59:55,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2024-11-22 18:59:55,266 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:59:55,279 INFO L349 Elim1Store]: treesize reduction 29, result has 34.1 percent of original size [2024-11-22 18:59:55,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 41 [2024-11-22 18:59:55,373 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 [2024-11-22 18:59:55,380 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 27 treesize of output 22 [2024-11-22 18:59:55,473 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2024-11-22 18:59:55,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 56 [2024-11-22 18:59:55,475 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 12 treesize of output 8 [2024-11-22 18:59:55,480 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 24 treesize of output 11 [2024-11-22 18:59:55,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-22 18:59:55,559 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 [2024-11-22 18:59:55,570 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 55 treesize of output 19 [2024-11-22 18:59:55,577 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 77 treesize of output 29 [2024-11-22 18:59:55,663 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 82 treesize of output 54 [2024-11-22 18:59:55,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 38 [2024-11-22 18:59:55,800 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 35 treesize of output 17 [2024-11-22 18:59:55,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-22 18:59:55,896 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:59:55,896 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:59:56,392 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_3611 (Array Int Int)) (v_ArrVal_3612 (Array Int Int)) (v_ArrVal_3613 (Array Int Int)) (v_ArrVal_3614 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (<= (+ (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_3611) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3613))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse2) .cse3) 12) (select |c_#length| (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_3612) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3614))) (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse2) .cse3)))) (forall ((v_ArrVal_3611 (Array Int Int)) (v_ArrVal_3613 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (<= 0 (+ (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_3611) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3613))) (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse2) .cse3) 8))))) is different from false [2024-11-22 18:59:56,418 INFO L349 Elim1Store]: treesize reduction 31, result has 58.1 percent of original size [2024-11-22 18:59:56,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 304 treesize of output 302 [2024-11-22 18:59:56,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:59:56,427 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 1014 treesize of output 1002 [2024-11-22 18:59:56,438 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 628 treesize of output 598 [2024-11-22 18:59:56,445 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 774 treesize of output 714 [2024-11-22 18:59:56,463 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 10 treesize of output 4 [2024-11-22 18:59:56,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:59:56,681 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 129 treesize of output 133 [2024-11-22 18:59:56,725 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:59:56,726 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:59:56,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:59:56,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:59:56,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 77 [2024-11-22 18:59:56,732 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:59:56,732 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:59:56,734 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 71 treesize of output 67 [2024-11-22 18:59:56,735 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:59:56,737 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2024-11-22 18:59:56,818 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (and (not (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (<= 0 (+ |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.offset| 8)) (forall ((|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) (forall ((|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_3612 (Array Int Int)) (v_ArrVal_3614 (Array Int Int))) (< (+ |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.offset| 11) (select |c_#length| (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_3612) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3614) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_3612) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3614) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|)) .cse0) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2024-11-22 18:59:56,837 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (and (not (= |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (not (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (forall ((|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) (forall ((|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_3612 (Array Int Int)) (v_ArrVal_3614 (Array Int Int))) (< (+ |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.offset| 11) (select |c_#length| (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_3612) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3614) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base| v_ArrVal_3612) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3614) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|)) .cse0) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (<= 0 (+ |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.offset| 8)))) is different from false [2024-11-22 18:59:56,855 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|)) (.cse3 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse2 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (and (not (= |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (forall ((|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_3612 (Array Int Int)) (v_ArrVal_3614 (Array Int Int))) (< (+ .cse0 11) (select |c_#length| (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_3612) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3614) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse1)) .cse1 v_ArrVal_3612) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3614) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|)) .cse2) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (= .cse2 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (<= 0 (+ .cse0 8)) (forall ((|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) (not (= .cse2 .cse1))))) is different from false [2024-11-22 18:59:58,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75133316] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:59:58,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:59:58,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 31] total 57 [2024-11-22 18:59:58,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868735355] [2024-11-22 18:59:58,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:59:58,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-22 18:59:58,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:59:58,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-22 18:59:58,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=4795, Unknown=95, NotChecked=572, Total=5700 [2024-11-22 18:59:58,059 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 58 states, 55 states have (on average 1.9272727272727272) internal successors, (106), 52 states have internal predecessors, (106), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-22 19:00:00,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:00:00,876 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2024-11-22 19:00:00,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-22 19:00:00,877 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 55 states have (on average 1.9272727272727272) internal successors, (106), 52 states have internal predecessors, (106), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 63 [2024-11-22 19:00:00,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:00:00,877 INFO L225 Difference]: With dead ends: 102 [2024-11-22 19:00:00,877 INFO L226 Difference]: Without dead ends: 102 [2024-11-22 19:00:00,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1745 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=490, Invalid=9305, Unknown=121, NotChecked=796, Total=10712 [2024-11-22 19:00:00,880 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 78 mSDsluCounter, 1823 mSDsCounter, 0 mSdLazyCounter, 2445 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1878 SdHoareTripleChecker+Invalid, 2456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-22 19:00:00,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1878 Invalid, 2456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2445 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-22 19:00:00,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-22 19:00:00,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2024-11-22 19:00:00,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 92 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 19:00:00,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2024-11-22 19:00:00,882 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 63 [2024-11-22 19:00:00,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:00:00,882 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2024-11-22 19:00:00,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 55 states have (on average 1.9272727272727272) internal successors, (106), 52 states have internal predecessors, (106), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-22 19:00:00,882 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2024-11-22 19:00:00,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-22 19:00:00,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:00:00,882 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:00:00,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-22 19:00:01,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-22 19:00:01,083 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-11-22 19:00:01,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:00:01,083 INFO L85 PathProgramCache]: Analyzing trace with hash -208454633, now seen corresponding path program 1 times [2024-11-22 19:00:01,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:00:01,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307052590] [2024-11-22 19:00:01,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:01,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:00:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:03,359 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:00:03,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:00:03,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307052590] [2024-11-22 19:00:03,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307052590] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:00:03,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756713894] [2024-11-22 19:00:03,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:00:03,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:00:03,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:00:03,361 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:00:03,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-22 19:00:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:00:03,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 158 conjuncts are in the unsatisfiable core [2024-11-22 19:00:03,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:00:03,640 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 [2024-11-22 19:00:03,802 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 13 treesize of output 9 [2024-11-22 19:00:03,891 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 19:00:03,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-22 19:00:03,999 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 25 treesize of output 13 [2024-11-22 19:00:04,021 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 18 treesize of output 13 [2024-11-22 19:00:04,130 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 18 treesize of output 13 [2024-11-22 19:00:04,141 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 29 treesize of output 13 [2024-11-22 19:00:04,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 19:00:04,320 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 42 treesize of output 14 [2024-11-22 19:00:04,322 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 17 treesize of output 3 [2024-11-22 19:00:04,324 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 15 treesize of output 7 [2024-11-22 19:00:04,400 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-22 19:00:04,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-11-22 19:00:04,443 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (let ((.cse3 (+ .cse5 4))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_47| .cse1) .cse3)) (.cse2 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_47| |c_#memory_$Pointer$#1.base|))) (and (not (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse2) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_47| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2)))))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse3))) (and (not (= .cse1 .cse4)) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse4)))))) (let ((.cse6 (+ 8 .cse5))) (or (exists ((|v_#memory_int#1_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse7 (@diff |v_#memory_int#1_BEFORE_CALL_2| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_2| .cse1) .cse6) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_2| .cse7 (select |c_#memory_int#1| .cse7))) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse7)))) (= (select (select |c_#memory_int#1| .cse1) .cse6) 1))) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2024-11-22 19:00:04,446 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (let ((.cse3 (+ .cse5 4))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_47| .cse1) .cse3)) (.cse2 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_47| |c_#memory_$Pointer$#1.base|))) (and (not (= .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse2) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_47| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2)))))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse3))) (and (not (= .cse1 .cse4)) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse4)))))) (let ((.cse6 (+ 8 .cse5))) (or (exists ((|v_#memory_int#1_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse7 (@diff |v_#memory_int#1_BEFORE_CALL_2| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_2| .cse1) .cse6) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_2| .cse7 (select |c_#memory_int#1| .cse7))) (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse7)))) (= (select (select |c_#memory_int#1| .cse1) .cse6) 1))) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2024-11-22 19:00:05,115 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:00:05,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 69 [2024-11-22 19:00:05,120 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:00:05,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 49 [2024-11-22 19:00:05,201 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 [2024-11-22 19:00:05,208 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 41 treesize of output 28 [2024-11-22 19:00:05,218 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 18 treesize of output 13 [2024-11-22 19:00:05,305 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2024-11-22 19:00:05,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 154 treesize of output 123 [2024-11-22 19:00:05,309 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 112 treesize of output 89 [2024-11-22 19:00:05,312 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 40 treesize of output 16 [2024-11-22 19:00:05,320 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 57 treesize of output 21 [2024-11-22 19:00:05,400 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 42 treesize of output 33 [2024-11-22 19:00:05,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-22 19:00:05,408 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 26 treesize of output 21 [2024-11-22 19:00:05,425 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 123 treesize of output 63 [2024-11-22 19:00:05,430 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 50 treesize of output 37 [2024-11-22 19:00:05,432 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 73 treesize of output 37 [2024-11-22 19:00:05,525 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 113 treesize of output 77 [2024-11-22 19:00:05,528 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 81 treesize of output 53 [2024-11-22 19:00:05,676 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 57 treesize of output 29 [2024-11-22 19:00:05,678 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 21 treesize of output 13 [2024-11-22 19:00:05,833 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:00:05,834 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:00:06,561 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3890 (Array Int Int)) (v_ArrVal_3884 (Array Int Int)) (v_ArrVal_3885 (Array Int Int)) (v_ArrVal_3886 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3886) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3890) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3885))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse2) .cse3)) (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3884))) (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse2) .cse3) 8))))) is different from false [2024-11-22 19:00:06,569 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3890 (Array Int Int)) (v_ArrVal_3880 (Array Int Int)) (v_ArrVal_3882 (Array Int Int)) (v_ArrVal_3884 (Array Int Int)) (v_ArrVal_3885 (Array Int Int)) (v_ArrVal_3886 (Array Int Int)) (v_ArrVal_3881 Int) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.offset| 4) v_ArrVal_3881)) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3886) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_3890) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_3882) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3885))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base|))) .cse2) .cse3)) (+ 8 (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_3880) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_3884))) (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) .cse1 |ULTIMATE.start_dll_circular_prepend_~last~1#1.offset|))) .cse2) .cse3)))))) is different from false [2024-11-22 19:00:06,598 INFO L349 Elim1Store]: treesize reduction 31, result has 58.1 percent of original size [2024-11-22 19:00:06,598 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 2 case distinctions, treesize of input 824 treesize of output 822 [2024-11-22 19:00:06,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:06,610 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 1890 treesize of output 1886 [2024-11-22 19:00:06,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2536 treesize of output 2476 [2024-11-22 19:00:06,632 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 2824 treesize of output 2794 [2024-11-22 19:00:06,651 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 10 treesize of output 4 [2024-11-22 19:00:07,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:07,910 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 152 treesize of output 150 [2024-11-22 19:00:08,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:08,051 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 152 treesize of output 150 [2024-11-22 19:00:08,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:08,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2024-11-22 19:00:08,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:08,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2024-11-22 19:00:08,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:08,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2024-11-22 19:00:08,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:08,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2024-11-22 19:00:08,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:08,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2024-11-22 19:00:08,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:08,209 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 168 treesize of output 166 [2024-11-22 19:00:09,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:09,157 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 314 treesize of output 302 [2024-11-22 19:00:09,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:09,247 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 141 treesize of output 139 [2024-11-22 19:00:09,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:09,690 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 142 treesize of output 140 [2024-11-22 19:00:09,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:09,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2024-11-22 19:00:10,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:10,837 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 196 treesize of output 189 [2024-11-22 19:00:10,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:10,859 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 131 treesize of output 129 [2024-11-22 19:00:10,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:10,891 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 131 treesize of output 129 [2024-11-22 19:00:10,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:10,906 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 196 treesize of output 189 [2024-11-22 19:00:11,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:11,048 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 261 treesize of output 249 [2024-11-22 19:00:11,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:11,068 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 196 treesize of output 189 [2024-11-22 19:00:11,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:11,088 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 261 treesize of output 249 [2024-11-22 19:00:11,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:11,212 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 131 treesize of output 129 [2024-11-22 19:00:11,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:11,227 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 131 treesize of output 129 [2024-11-22 19:00:11,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:11,609 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 196 treesize of output 189 [2024-11-22 19:00:11,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:11,627 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 131 treesize of output 129 [2024-11-22 19:00:11,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:11,645 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 196 treesize of output 189 [2024-11-22 19:00:11,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:11,691 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 131 treesize of output 129 [2024-11-22 19:00:12,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:12,061 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 196 treesize of output 189 [2024-11-22 19:00:12,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:12,076 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 131 treesize of output 129 [2024-11-22 19:00:12,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:12,299 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 131 treesize of output 129 [2024-11-22 19:00:12,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:12,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 129 [2024-11-22 19:00:12,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:12,553 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 131 treesize of output 129 [2024-11-22 19:00:12,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:12,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 131 treesize of output 129 [2024-11-22 19:00:12,695 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:12,695 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 137 treesize of output 135 [2024-11-22 19:00:12,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:12,708 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 202 treesize of output 195 [2024-11-22 19:00:13,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:13,366 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 196 treesize of output 189 [2024-11-22 19:00:13,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:13,382 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 131 treesize of output 129 [2024-11-22 19:00:13,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:13,400 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 131 treesize of output 129 [2024-11-22 19:00:13,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:13,434 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 202 treesize of output 195 [2024-11-22 19:00:13,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:13,454 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 202 treesize of output 195 [2024-11-22 19:00:13,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:13,471 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 267 treesize of output 255 [2024-11-22 19:00:13,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:13,493 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 202 treesize of output 195 [2024-11-22 19:00:13,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:13,515 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 267 treesize of output 255 [2024-11-22 19:00:40,181 WARN L286 SmtUtils]: Spent 26.20s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-22 19:00:40,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:00:40,188 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 39860 treesize of output 39312