./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_equal.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 e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:34:49,314 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:34:49,381 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 16:34:49,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:34:49,387 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:34:49,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:34:49,412 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:34:49,412 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:34:49,413 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:34:49,416 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:34:49,417 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:34:49,417 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:34:49,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:34:49,418 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:34:49,418 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:34:49,418 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:34:49,419 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:34:49,419 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:34:49,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:34:49,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:34:49,421 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:34:49,421 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:34:49,422 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:34:49,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:34:49,422 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:34:49,423 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:34:49,423 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:34:49,423 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:34:49,423 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:34:49,424 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:34:49,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:34:49,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:34:49,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:34:49,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:34:49,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:34:49,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:34:49,426 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 16:34:49,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 16:34:49,426 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:34:49,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:34:49,427 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:34:49,428 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:34:49,428 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 -> e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 [2024-10-24 16:34:49,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:34:49,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:34:49,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:34:49,739 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:34:49,739 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:34:49,740 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2024-10-24 16:34:51,139 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:34:51,398 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:34:51,398 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2024-10-24 16:34:51,413 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9693abba1/3981df8ce48d4e2db4e5282cf07453ec/FLAGb1068dcba [2024-10-24 16:34:51,427 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9693abba1/3981df8ce48d4e2db4e5282cf07453ec [2024-10-24 16:34:51,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:34:51,432 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:34:51,434 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:34:51,434 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:34:51,442 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:34:51,443 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:34:51" (1/1) ... [2024-10-24 16:34:51,445 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@656ad659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:34:51, skipping insertion in model container [2024-10-24 16:34:51,446 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:34:51" (1/1) ... [2024-10-24 16:34:51,487 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:34:51,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:34:51,850 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 16:34:51,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:34:51,942 INFO L204 MainTranslator]: Completed translation [2024-10-24 16:34:51,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:34:51 WrapperNode [2024-10-24 16:34:51,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:34:51,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 16:34:51,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 16:34:51,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 16:34:51,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:34:51" (1/1) ... [2024-10-24 16:34:51,972 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:34:51" (1/1) ... [2024-10-24 16:34:52,001 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 145 [2024-10-24 16:34:52,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 16:34:52,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 16:34:52,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 16:34:52,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 16:34:52,015 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:34:51" (1/1) ... [2024-10-24 16:34:52,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:34:51" (1/1) ... [2024-10-24 16:34:52,019 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:34:51" (1/1) ... [2024-10-24 16:34:52,046 INFO L175 MemorySlicer]: Split 29 memory accesses to 3 slices as follows [2, 18, 9]. 62 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-10-24 16:34:52,047 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:34:51" (1/1) ... [2024-10-24 16:34:52,047 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:34:51" (1/1) ... [2024-10-24 16:34:52,062 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:34:51" (1/1) ... [2024-10-24 16:34:52,070 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:34:51" (1/1) ... [2024-10-24 16:34:52,072 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:34:51" (1/1) ... [2024-10-24 16:34:52,077 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:34:51" (1/1) ... [2024-10-24 16:34:52,081 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 16:34:52,085 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 16:34:52,085 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 16:34:52,085 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 16:34:52,086 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:34:51" (1/1) ... [2024-10-24 16:34:52,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:34:52,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:34:52,126 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-10-24 16:34:52,129 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-10-24 16:34:52,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 16:34:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 16:34:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 16:34:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 16:34:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 16:34:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 16:34:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-24 16:34:52,185 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-24 16:34:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 16:34:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 16:34:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 16:34:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 16:34:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 16:34:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 16:34:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 16:34:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 16:34:52,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 16:34:52,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 16:34:52,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-24 16:34:52,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-24 16:34:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-24 16:34:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 16:34:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 16:34:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 16:34:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 16:34:52,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 16:34:52,340 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 16:34:52,342 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 16:34:52,735 INFO L? ?]: Removed 146 outVars from TransFormulas that were not future-live. [2024-10-24 16:34:52,735 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 16:34:52,786 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 16:34:52,786 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-24 16:34:52,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:34:52 BoogieIcfgContainer [2024-10-24 16:34:52,787 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 16:34:52,791 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 16:34:52,791 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 16:34:52,795 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 16:34:52,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:34:51" (1/3) ... [2024-10-24 16:34:52,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48e5288b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:34:52, skipping insertion in model container [2024-10-24 16:34:52,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:34:51" (2/3) ... [2024-10-24 16:34:52,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48e5288b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:34:52, skipping insertion in model container [2024-10-24 16:34:52,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:34:52" (3/3) ... [2024-10-24 16:34:52,797 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_equal.i [2024-10-24 16:34:52,813 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 16:34:52,814 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2024-10-24 16:34:52,861 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 16:34:52,868 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;@67b2ce9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 16:34:52,868 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2024-10-24 16:34:52,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 55 states have (on average 2.327272727272727) internal successors, (128), 115 states have internal predecessors, (128), 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-10-24 16:34:52,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-24 16:34:52,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:34:52,880 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-24 16:34:52,881 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-24 16:34:52,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:34:52,887 INFO L85 PathProgramCache]: Analyzing trace with hash 234339174, now seen corresponding path program 1 times [2024-10-24 16:34:52,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:34:52,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895042210] [2024-10-24 16:34:52,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:34:52,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:34:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:34:53,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:34:53,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:34:53,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895042210] [2024-10-24 16:34:53,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895042210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:34:53,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:34:53,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:34:53,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568670645] [2024-10-24 16:34:53,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:34:53,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:34:53,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:34:53,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:34:53,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:34:53,184 INFO L87 Difference]: Start difference. First operand has 120 states, 55 states have (on average 2.327272727272727) internal successors, (128), 115 states have internal predecessors, (128), 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.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-24 16:34:53,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:34:53,339 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2024-10-24 16:34:53,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:34:53,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2024-10-24 16:34:53,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:34:53,350 INFO L225 Difference]: With dead ends: 116 [2024-10-24 16:34:53,351 INFO L226 Difference]: Without dead ends: 114 [2024-10-24 16:34:53,352 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-10-24 16:34:53,356 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 2 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:34:53,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 168 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:34:53,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-24 16:34:53,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-10-24 16:34:53,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 53 states have (on average 2.188679245283019) internal successors, (116), 109 states have internal predecessors, (116), 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-10-24 16:34:53,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2024-10-24 16:34:53,405 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 5 [2024-10-24 16:34:53,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:34:53,406 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2024-10-24 16:34:53,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-24 16:34:53,407 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2024-10-24 16:34:53,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-24 16:34:53,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:34:53,407 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-24 16:34:53,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 16:34:53,408 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-24 16:34:53,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:34:53,409 INFO L85 PathProgramCache]: Analyzing trace with hash 234339175, now seen corresponding path program 1 times [2024-10-24 16:34:53,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:34:53,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020527358] [2024-10-24 16:34:53,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:34:53,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:34:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:34:53,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:34:53,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:34:53,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020527358] [2024-10-24 16:34:53,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020527358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:34:53,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:34:53,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:34:53,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476037792] [2024-10-24 16:34:53,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:34:53,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:34:53,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:34:53,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:34:53,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:34:53,551 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-24 16:34:53,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:34:53,659 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2024-10-24 16:34:53,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:34:53,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2024-10-24 16:34:53,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:34:53,661 INFO L225 Difference]: With dead ends: 111 [2024-10-24 16:34:53,661 INFO L226 Difference]: Without dead ends: 111 [2024-10-24 16:34:53,662 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-10-24 16:34:53,663 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 2 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:34:53,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 172 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:34:53,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-24 16:34:53,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-24 16:34:53,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 53 states have (on average 2.1320754716981134) internal successors, (113), 106 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-10-24 16:34:53,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2024-10-24 16:34:53,675 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 5 [2024-10-24 16:34:53,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:34:53,675 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2024-10-24 16:34:53,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-24 16:34:53,676 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2024-10-24 16:34:53,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 16:34:53,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:34:53,676 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:34:53,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 16:34:53,677 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-24 16:34:53,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:34:53,678 INFO L85 PathProgramCache]: Analyzing trace with hash -596233681, now seen corresponding path program 1 times [2024-10-24 16:34:53,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:34:53,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456781722] [2024-10-24 16:34:53,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:34:53,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:34:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:34:53,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:34:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:34:53,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:34:53,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:34:53,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456781722] [2024-10-24 16:34:53,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456781722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:34:53,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:34:53,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:34:53,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101376306] [2024-10-24 16:34:53,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:34:53,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:34:53,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:34:53,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:34:53,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:34:53,855 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:34:53,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:34:53,987 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2024-10-24 16:34:53,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:34:53,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-24 16:34:53,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:34:53,989 INFO L225 Difference]: With dead ends: 112 [2024-10-24 16:34:53,991 INFO L226 Difference]: Without dead ends: 112 [2024-10-24 16:34:53,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:34:53,992 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 10 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:34:53,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 231 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:34:53,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-24 16:34:54,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-24 16:34:54,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 54 states have (on average 2.111111111111111) internal successors, (114), 107 states have internal predecessors, (114), 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-10-24 16:34:54,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2024-10-24 16:34:54,007 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 11 [2024-10-24 16:34:54,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:34:54,008 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2024-10-24 16:34:54,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:34:54,009 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2024-10-24 16:34:54,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-24 16:34:54,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:34:54,009 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:34:54,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 16:34:54,010 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-24 16:34:54,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:34:54,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1003078540, now seen corresponding path program 1 times [2024-10-24 16:34:54,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:34:54,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006113525] [2024-10-24 16:34:54,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:34:54,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:34:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:34:54,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:34:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:34:54,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 16:34:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:34:54,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 16:34:54,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:34:54,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006113525] [2024-10-24 16:34:54,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006113525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:34:54,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:34:54,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:34:54,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424659984] [2024-10-24 16:34:54,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:34:54,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:34:54,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:34:54,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:34:54,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:34:54,223 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-10-24 16:34:54,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:34:54,491 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2024-10-24 16:34:54,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:34:54,492 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 19 [2024-10-24 16:34:54,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:34:54,493 INFO L225 Difference]: With dead ends: 111 [2024-10-24 16:34:54,493 INFO L226 Difference]: Without dead ends: 111 [2024-10-24 16:34:54,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-10-24 16:34:54,495 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 7 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:34:54,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 344 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:34:54,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-24 16:34:54,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-24 16:34:54,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 106 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-10-24 16:34:54,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2024-10-24 16:34:54,504 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 19 [2024-10-24 16:34:54,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:34:54,505 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2024-10-24 16:34:54,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-10-24 16:34:54,505 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2024-10-24 16:34:54,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-24 16:34:54,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:34:54,506 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:34:54,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 16:34:54,506 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-24 16:34:54,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:34:54,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1003078539, now seen corresponding path program 1 times [2024-10-24 16:34:54,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:34:54,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619552012] [2024-10-24 16:34:54,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:34:54,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:34:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:34:54,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:34:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:34:54,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 16:34:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:34:54,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:34:54,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:34:54,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619552012] [2024-10-24 16:34:54,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619552012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:34:54,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:34:54,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:34:54,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180742487] [2024-10-24 16:34:54,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:34:54,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:34:54,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:34:54,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:34:54,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:34:54,829 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-10-24 16:34:55,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:34:55,092 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2024-10-24 16:34:55,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:34:55,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 19 [2024-10-24 16:34:55,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:34:55,094 INFO L225 Difference]: With dead ends: 110 [2024-10-24 16:34:55,094 INFO L226 Difference]: Without dead ends: 110 [2024-10-24 16:34:55,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-10-24 16:34:55,095 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 6 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:34:55,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 368 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:34:55,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-24 16:34:55,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-24 16:34:55,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 54 states have (on average 2.074074074074074) internal successors, (112), 105 states have internal predecessors, (112), 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-10-24 16:34:55,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2024-10-24 16:34:55,110 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 19 [2024-10-24 16:34:55,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:34:55,110 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2024-10-24 16:34:55,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-10-24 16:34:55,111 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2024-10-24 16:34:55,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 16:34:55,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:34:55,112 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:34:55,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 16:34:55,112 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-24 16:34:55,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:34:55,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1885802923, now seen corresponding path program 1 times [2024-10-24 16:34:55,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:34:55,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099177839] [2024-10-24 16:34:55,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:34:55,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:34:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:34:55,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:34:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:34:55,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 16:34:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:34:55,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:34:55,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:34:55,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099177839] [2024-10-24 16:34:55,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099177839] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:34:55,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092560876] [2024-10-24 16:34:55,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:34:55,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:34:55,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:34:55,409 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-10-24 16:34:55,411 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-10-24 16:34:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:34:55,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 16:34:55,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:34:55,571 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-10-24 16:34:55,617 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-10-24 16:34:55,653 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-24 16:34:55,654 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-10-24 16:34:55,669 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-10-24 16:34:55,669 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:34:55,843 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:34:55,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092560876] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:34:55,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:34:55,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 11 [2024-10-24 16:34:55,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59698916] [2024-10-24 16:34:55,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:34:55,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 16:34:55,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:34:55,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 16:34:55,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-10-24 16:34:55,846 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:34:56,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:34:56,309 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2024-10-24 16:34:56,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:34:56,310 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 21 [2024-10-24 16:34:56,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:34:56,311 INFO L225 Difference]: With dead ends: 115 [2024-10-24 16:34:56,312 INFO L226 Difference]: Without dead ends: 115 [2024-10-24 16:34:56,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=119, Unknown=1, NotChecked=22, Total=182 [2024-10-24 16:34:56,313 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:34:56,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 530 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 607 Invalid, 0 Unknown, 121 Unchecked, 0.4s Time] [2024-10-24 16:34:56,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-24 16:34:56,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-24 16:34:56,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 58 states have (on average 2.0344827586206895) internal successors, (118), 109 states have internal predecessors, (118), 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-10-24 16:34:56,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2024-10-24 16:34:56,326 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 21 [2024-10-24 16:34:56,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:34:56,326 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2024-10-24 16:34:56,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:34:56,327 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2024-10-24 16:34:56,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 16:34:56,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:34:56,327 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:34:56,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 16:34:56,528 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-10-24 16:34:56,529 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-24 16:34:56,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:34:56,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1885802922, now seen corresponding path program 1 times [2024-10-24 16:34:56,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:34:56,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098203257] [2024-10-24 16:34:56,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:34:56,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:34:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:34:56,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:34:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:34:56,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 16:34:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:34:56,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:34:56,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:34:56,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098203257] [2024-10-24 16:34:56,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098203257] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:34:56,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957802877] [2024-10-24 16:34:56,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:34:56,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:34:56,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:34:56,912 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-10-24 16:34:56,914 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-10-24 16:34:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:34:57,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-24 16:34:57,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:34:57,044 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-10-24 16:34:57,049 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-10-24 16:34:57,211 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-10-24 16:34:57,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:34:57,252 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-10-24 16:34:57,260 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:34:57,261 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-10-24 16:34:57,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-10-24 16:34:57,294 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:34:57,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957802877] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:34:57,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:34:57,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-24 16:34:57,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090994080] [2024-10-24 16:34:57,441 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:34:57,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 16:34:57,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:34:57,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 16:34:57,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=232, Unknown=1, NotChecked=30, Total=306 [2024-10-24 16:34:57,443 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand has 16 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 16:34:58,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:34:58,118 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2024-10-24 16:34:58,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:34:58,119 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 21 [2024-10-24 16:34:58,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:34:58,120 INFO L225 Difference]: With dead ends: 115 [2024-10-24 16:34:58,120 INFO L226 Difference]: Without dead ends: 115 [2024-10-24 16:34:58,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=358, Unknown=1, NotChecked=38, Total=462 [2024-10-24 16:34:58,121 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 16:34:58,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 680 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 925 Invalid, 0 Unknown, 120 Unchecked, 0.6s Time] [2024-10-24 16:34:58,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-24 16:34:58,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-24 16:34:58,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 58 states have (on average 2.0172413793103448) internal successors, (117), 109 states have internal predecessors, (117), 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-10-24 16:34:58,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2024-10-24 16:34:58,127 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 21 [2024-10-24 16:34:58,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:34:58,127 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2024-10-24 16:34:58,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 16:34:58,128 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2024-10-24 16:34:58,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 16:34:58,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:34:58,128 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:34:58,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 16:34:58,332 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-10-24 16:34:58,333 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-24 16:34:58,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:34:58,333 INFO L85 PathProgramCache]: Analyzing trace with hash 219744043, now seen corresponding path program 1 times [2024-10-24 16:34:58,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:34:58,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57609745] [2024-10-24 16:34:58,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:34:58,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:34:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:34:58,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:34:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:34:58,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 16:34:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:34:58,471 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:34:58,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:34:58,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57609745] [2024-10-24 16:34:58,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57609745] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:34:58,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849574613] [2024-10-24 16:34:58,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:34:58,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:34:58,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:34:58,474 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-10-24 16:34:58,475 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-10-24 16:34:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:34:58,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 16:34:58,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:34:58,635 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:34:58,636 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:34:58,662 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:34:58,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849574613] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:34:58,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:34:58,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2024-10-24 16:34:58,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137201925] [2024-10-24 16:34:58,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:34:58,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:34:58,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:34:58,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:34:58,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:34:58,664 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:34:58,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:34:58,808 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2024-10-24 16:34:58,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:34:58,809 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-10-24 16:34:58,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:34:58,809 INFO L225 Difference]: With dead ends: 115 [2024-10-24 16:34:58,809 INFO L226 Difference]: Without dead ends: 115 [2024-10-24 16:34:58,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 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-10-24 16:34:58,810 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 1 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:34:58,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 515 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:34:58,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-24 16:34:58,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-24 16:34:58,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 58 states have (on average 2.0) internal successors, (116), 109 states have internal predecessors, (116), 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-10-24 16:34:58,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2024-10-24 16:34:58,816 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 23 [2024-10-24 16:34:58,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:34:58,816 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2024-10-24 16:34:58,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:34:58,816 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2024-10-24 16:34:58,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-24 16:34:58,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:34:58,817 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:34:58,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 16:34:59,018 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-10-24 16:34:59,019 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-24 16:34:59,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:34:59,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1782649922, now seen corresponding path program 1 times [2024-10-24 16:34:59,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:34:59,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590001916] [2024-10-24 16:34:59,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:34:59,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:34:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:34:59,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:34:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:34:59,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 16:34:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:34:59,112 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 16:34:59,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:34:59,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590001916] [2024-10-24 16:34:59,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590001916] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:34:59,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125442318] [2024-10-24 16:34:59,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:34:59,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:34:59,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:34:59,115 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-10-24 16:34:59,117 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-10-24 16:34:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:34:59,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 16:34:59,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:34:59,249 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-10-24 16:34:59,306 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-10-24 16:34:59,347 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-24 16:34:59,347 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-10-24 16:34:59,357 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2024-10-24 16:34:59,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:34:59,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125442318] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:34:59,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:34:59,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2024-10-24 16:34:59,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268425406] [2024-10-24 16:34:59,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:34:59,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 16:34:59,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:34:59,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 16:34:59,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=89, Unknown=1, NotChecked=18, Total=132 [2024-10-24 16:34:59,417 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 16:34:59,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:34:59,750 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2024-10-24 16:34:59,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:34:59,750 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2024-10-24 16:34:59,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:34:59,751 INFO L225 Difference]: With dead ends: 114 [2024-10-24 16:34:59,751 INFO L226 Difference]: Without dead ends: 114 [2024-10-24 16:34:59,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=149, Unknown=1, NotChecked=24, Total=210 [2024-10-24 16:34:59,752 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 9 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:34:59,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 427 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 473 Invalid, 0 Unknown, 118 Unchecked, 0.3s Time] [2024-10-24 16:34:59,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-24 16:34:59,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-10-24 16:34:59,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 58 states have (on average 1.9827586206896552) internal successors, (115), 108 states have internal predecessors, (115), 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-10-24 16:34:59,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2024-10-24 16:34:59,757 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 24 [2024-10-24 16:34:59,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:34:59,757 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2024-10-24 16:34:59,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 16:34:59,758 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2024-10-24 16:34:59,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-24 16:34:59,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:34:59,759 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:34:59,775 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-10-24 16:34:59,962 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-10-24 16:34:59,963 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-24 16:34:59,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:34:59,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1782649921, now seen corresponding path program 1 times [2024-10-24 16:34:59,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:34:59,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114647372] [2024-10-24 16:34:59,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:34:59,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:34:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:00,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:35:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:00,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 16:35:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:00,210 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:35:00,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:35:00,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114647372] [2024-10-24 16:35:00,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114647372] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:35:00,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930322240] [2024-10-24 16:35:00,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:00,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:35:00,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:35:00,213 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-10-24 16:35:00,214 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-10-24 16:35:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:00,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-24 16:35:00,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:35:00,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-10-24 16:35:00,377 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-10-24 16:35:00,506 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-10-24 16:35:00,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:35:00,535 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-10-24 16:35:00,542 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:35:00,543 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-10-24 16:35:00,581 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-10-24 16:35:00,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:35:00,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930322240] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:35:00,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:35:00,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-24 16:35:00,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127473855] [2024-10-24 16:35:00,704 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:35:00,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 16:35:00,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:35:00,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 16:35:00,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=230, Unknown=1, NotChecked=30, Total=306 [2024-10-24 16:35:00,705 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand has 16 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 16:35:01,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:35:01,148 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2024-10-24 16:35:01,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:35:01,148 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2024-10-24 16:35:01,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:35:01,150 INFO L225 Difference]: With dead ends: 131 [2024-10-24 16:35:01,150 INFO L226 Difference]: Without dead ends: 131 [2024-10-24 16:35:01,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=353, Unknown=1, NotChecked=38, Total=462 [2024-10-24 16:35:01,152 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 24 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:35:01,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 613 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 541 Invalid, 0 Unknown, 140 Unchecked, 0.4s Time] [2024-10-24 16:35:01,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-24 16:35:01,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 124. [2024-10-24 16:35:01,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 117 states have internal predecessors, (129), 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-10-24 16:35:01,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 139 transitions. [2024-10-24 16:35:01,173 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 139 transitions. Word has length 24 [2024-10-24 16:35:01,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:35:01,178 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 139 transitions. [2024-10-24 16:35:01,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 16:35:01,178 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 139 transitions. [2024-10-24 16:35:01,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-24 16:35:01,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:35:01,179 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:35:01,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-24 16:35:01,379 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,SelfDestructingSolverStorable9 [2024-10-24 16:35:01,380 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-24 16:35:01,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:35:01,381 INFO L85 PathProgramCache]: Analyzing trace with hash 572427271, now seen corresponding path program 1 times [2024-10-24 16:35:01,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:35:01,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258245785] [2024-10-24 16:35:01,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:01,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:35:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:01,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:35:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:01,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 16:35:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:01,549 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 16:35:01,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:35:01,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258245785] [2024-10-24 16:35:01,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258245785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:35:01,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:35:01,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 16:35:01,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731161856] [2024-10-24 16:35:01,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:35:01,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:35:01,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:35:01,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:35:01,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:35:01,553 INFO L87 Difference]: Start difference. First operand 124 states and 139 transitions. Second operand has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-10-24 16:35:01,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:35:01,810 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2024-10-24 16:35:01,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:35:01,810 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 25 [2024-10-24 16:35:01,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:35:01,811 INFO L225 Difference]: With dead ends: 123 [2024-10-24 16:35:01,811 INFO L226 Difference]: Without dead ends: 123 [2024-10-24 16:35:01,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:35:01,812 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 6 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:35:01,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 392 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:35:01,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-24 16:35:01,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-10-24 16:35:01,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 67 states have (on average 1.9104477611940298) internal successors, (128), 116 states have internal predecessors, (128), 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-10-24 16:35:01,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 138 transitions. [2024-10-24 16:35:01,817 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 138 transitions. Word has length 25 [2024-10-24 16:35:01,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:35:01,818 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 138 transitions. [2024-10-24 16:35:01,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-10-24 16:35:01,818 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 138 transitions. [2024-10-24 16:35:01,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-24 16:35:01,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:35:01,819 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:35:01,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 16:35:01,819 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-24 16:35:01,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:35:01,820 INFO L85 PathProgramCache]: Analyzing trace with hash 572427272, now seen corresponding path program 1 times [2024-10-24 16:35:01,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:35:01,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953373743] [2024-10-24 16:35:01,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:01,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:35:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:02,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:35:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:02,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 16:35:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:02,136 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:35:02,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:35:02,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953373743] [2024-10-24 16:35:02,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953373743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:35:02,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:35:02,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 16:35:02,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398004207] [2024-10-24 16:35:02,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:35:02,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:35:02,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:35:02,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:35:02,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:35:02,138 INFO L87 Difference]: Start difference. First operand 123 states and 138 transitions. Second operand has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-10-24 16:35:02,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:35:02,401 INFO L93 Difference]: Finished difference Result 122 states and 137 transitions. [2024-10-24 16:35:02,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:35:02,401 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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 25 [2024-10-24 16:35:02,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:35:02,402 INFO L225 Difference]: With dead ends: 122 [2024-10-24 16:35:02,402 INFO L226 Difference]: Without dead ends: 122 [2024-10-24 16:35:02,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:35:02,403 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 5 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:35:02,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 417 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:35:02,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-24 16:35:02,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-10-24 16:35:02,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 115 states have internal predecessors, (127), 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-10-24 16:35:02,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 137 transitions. [2024-10-24 16:35:02,407 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 137 transitions. Word has length 25 [2024-10-24 16:35:02,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:35:02,409 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 137 transitions. [2024-10-24 16:35:02,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-10-24 16:35:02,410 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 137 transitions. [2024-10-24 16:35:02,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 16:35:02,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:35:02,413 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:35:02,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 16:35:02,414 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-24 16:35:02,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:35:02,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1960500334, now seen corresponding path program 1 times [2024-10-24 16:35:02,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:35:02,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654856904] [2024-10-24 16:35:02,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:02,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:35:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:02,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:35:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:02,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 16:35:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:02,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 16:35:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:02,861 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 16:35:02,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:35:02,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654856904] [2024-10-24 16:35:02,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654856904] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:35:02,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580051843] [2024-10-24 16:35:02,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:02,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:35:02,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:35:02,864 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-10-24 16:35:02,866 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-10-24 16:35:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:03,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 16:35:03,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:35:03,055 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-10-24 16:35:03,062 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-10-24 16:35:03,081 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-10-24 16:35:03,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:35:03,113 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-10-24 16:35:03,131 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-10-24 16:35:03,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:35:03,178 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-10-24 16:35:03,200 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-10-24 16:35:03,220 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-24 16:35:03,221 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-10-24 16:35:03,230 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 10 not checked. [2024-10-24 16:35:03,230 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:35:03,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580051843] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:35:03,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:35:03,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2024-10-24 16:35:03,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330546756] [2024-10-24 16:35:03,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:35:03,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 16:35:03,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:35:03,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 16:35:03,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=121, Unknown=2, NotChecked=46, Total=210 [2024-10-24 16:35:03,395 INFO L87 Difference]: Start difference. First operand 122 states and 137 transitions. Second operand has 13 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 16:35:03,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:35:03,781 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2024-10-24 16:35:03,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:35:03,782 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 34 [2024-10-24 16:35:03,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:35:03,782 INFO L225 Difference]: With dead ends: 131 [2024-10-24 16:35:03,783 INFO L226 Difference]: Without dead ends: 131 [2024-10-24 16:35:03,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=186, Unknown=2, NotChecked=58, Total=306 [2024-10-24 16:35:03,783 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 93 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 238 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:35:03,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 291 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 478 Invalid, 0 Unknown, 238 Unchecked, 0.3s Time] [2024-10-24 16:35:03,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-24 16:35:03,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 114. [2024-10-24 16:35:03,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 67 states have (on average 1.7761194029850746) internal successors, (119), 107 states have internal predecessors, (119), 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-10-24 16:35:03,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2024-10-24 16:35:03,787 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 34 [2024-10-24 16:35:03,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:35:03,787 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2024-10-24 16:35:03,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 16:35:03,788 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2024-10-24 16:35:03,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 16:35:03,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:35:03,788 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:35:03,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-24 16:35:03,992 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-10-24 16:35:03,993 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-24 16:35:03,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:35:03,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1960500333, now seen corresponding path program 1 times [2024-10-24 16:35:03,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:35:03,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883994099] [2024-10-24 16:35:03,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:03,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:35:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:04,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:35:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:04,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 16:35:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:04,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 16:35:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:04,541 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 16:35:04,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:35:04,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883994099] [2024-10-24 16:35:04,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883994099] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:35:04,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413338168] [2024-10-24 16:35:04,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:04,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:35:04,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:35:04,544 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-10-24 16:35:04,545 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-10-24 16:35:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:04,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-24 16:35:04,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:35:04,748 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-10-24 16:35:04,756 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-10-24 16:35:04,773 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-10-24 16:35:04,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:35:04,798 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-10-24 16:35:04,821 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-10-24 16:35:04,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:35:04,850 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-10-24 16:35:04,910 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-10-24 16:35:04,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:35:04,948 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-10-24 16:35:04,954 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-24 16:35:04,955 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:35:04,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413338168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:35:04,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 16:35:04,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2024-10-24 16:35:04,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883524792] [2024-10-24 16:35:04,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:35:04,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:35:04,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:35:04,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:35:04,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2024-10-24 16:35:04,957 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-10-24 16:35:05,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:35:05,082 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2024-10-24 16:35:05,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:35:05,082 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 34 [2024-10-24 16:35:05,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:35:05,083 INFO L225 Difference]: With dead ends: 109 [2024-10-24 16:35:05,083 INFO L226 Difference]: Without dead ends: 109 [2024-10-24 16:35:05,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2024-10-24 16:35:05,084 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 13 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:35:05,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 210 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 127 Unchecked, 0.1s Time] [2024-10-24 16:35:05,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-24 16:35:05,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-24 16:35:05,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 67 states have (on average 1.7014925373134329) internal successors, (114), 102 states have internal predecessors, (114), 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-10-24 16:35:05,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2024-10-24 16:35:05,088 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 34 [2024-10-24 16:35:05,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:35:05,088 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2024-10-24 16:35:05,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-10-24 16:35:05,089 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2024-10-24 16:35:05,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 16:35:05,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:35:05,089 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:35:05,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-24 16:35:05,290 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-10-24 16:35:05,290 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-24 16:35:05,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:35:05,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1077001948, now seen corresponding path program 1 times [2024-10-24 16:35:05,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:35:05,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190423887] [2024-10-24 16:35:05,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:05,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:35:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:05,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:35:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:05,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 16:35:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:05,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 16:35:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:05,396 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 16:35:05,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:35:05,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190423887] [2024-10-24 16:35:05,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190423887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:35:05,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:35:05,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:35:05,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454131516] [2024-10-24 16:35:05,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:35:05,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:35:05,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:35:05,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:35:05,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:35:05,398 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-10-24 16:35:05,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:35:05,511 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2024-10-24 16:35:05,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:35:05,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 34 [2024-10-24 16:35:05,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:35:05,512 INFO L225 Difference]: With dead ends: 91 [2024-10-24 16:35:05,512 INFO L226 Difference]: Without dead ends: 91 [2024-10-24 16:35:05,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:35:05,513 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:35:05,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 194 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:35:05,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-24 16:35:05,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-24 16:35:05,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 54 states have (on average 1.6851851851851851) internal successors, (91), 86 states have internal predecessors, (91), 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-10-24 16:35:05,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2024-10-24 16:35:05,517 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 34 [2024-10-24 16:35:05,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:35:05,517 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2024-10-24 16:35:05,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-10-24 16:35:05,518 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2024-10-24 16:35:05,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-24 16:35:05,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:35:05,519 INFO L215 NwaCegarLoop]: trace histogram [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-10-24 16:35:05,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 16:35:05,519 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-24 16:35:05,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:35:05,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1994826019, now seen corresponding path program 1 times [2024-10-24 16:35:05,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:35:05,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705121066] [2024-10-24 16:35:05,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:05,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:35:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:05,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:35:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:05,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 16:35:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:05,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 16:35:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:05,699 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-24 16:35:05,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:35:05,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705121066] [2024-10-24 16:35:05,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705121066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:35:05,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:35:05,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:35:05,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930372533] [2024-10-24 16:35:05,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:35:05,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:35:05,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:35:05,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:35:05,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:35:05,702 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 7 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-10-24 16:35:05,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:35:05,891 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2024-10-24 16:35:05,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:35:05,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 37 [2024-10-24 16:35:05,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:35:05,892 INFO L225 Difference]: With dead ends: 87 [2024-10-24 16:35:05,892 INFO L226 Difference]: Without dead ends: 87 [2024-10-24 16:35:05,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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-10-24 16:35:05,893 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 16 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:35:05,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 256 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:35:05,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-24 16:35:05,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-24 16:35:05,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 82 states have internal predecessors, (87), 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-10-24 16:35:05,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2024-10-24 16:35:05,896 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 37 [2024-10-24 16:35:05,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:35:05,898 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2024-10-24 16:35:05,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-10-24 16:35:05,898 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2024-10-24 16:35:05,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-24 16:35:05,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:35:05,898 INFO L215 NwaCegarLoop]: trace histogram [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-10-24 16:35:05,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 16:35:05,899 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-24 16:35:05,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:35:05,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1994826020, now seen corresponding path program 1 times [2024-10-24 16:35:05,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:35:05,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252091686] [2024-10-24 16:35:05,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:05,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:35:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:06,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:35:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:06,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 16:35:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:06,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 16:35:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:06,149 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 16:35:06,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:35:06,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252091686] [2024-10-24 16:35:06,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252091686] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:35:06,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120974131] [2024-10-24 16:35:06,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:06,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:35:06,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:35:06,152 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-10-24 16:35:06,153 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-10-24 16:35:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:06,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 16:35:06,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:35:06,392 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-10-24 16:35:06,467 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 16:35:06,467 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:35:06,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120974131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:35:06,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 16:35:06,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2024-10-24 16:35:06,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620154211] [2024-10-24 16:35:06,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:35:06,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:35:06,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:35:06,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:35:06,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-24 16:35:06,469 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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-10-24 16:35:06,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:35:06,581 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2024-10-24 16:35:06,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:35:06,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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 37 [2024-10-24 16:35:06,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:35:06,583 INFO L225 Difference]: With dead ends: 83 [2024-10-24 16:35:06,583 INFO L226 Difference]: Without dead ends: 83 [2024-10-24 16:35:06,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 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-10-24 16:35:06,584 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 15 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:35:06,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 239 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:35:06,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-24 16:35:06,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-24 16:35:06,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.537037037037037) internal successors, (83), 78 states have internal predecessors, (83), 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-10-24 16:35:06,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2024-10-24 16:35:06,587 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 37 [2024-10-24 16:35:06,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:35:06,587 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2024-10-24 16:35:06,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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-10-24 16:35:06,587 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2024-10-24 16:35:06,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-24 16:35:06,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:35:06,588 INFO L215 NwaCegarLoop]: trace histogram [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-10-24 16:35:06,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-24 16:35:06,788 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,SelfDestructingSolverStorable16 [2024-10-24 16:35:06,789 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-24 16:35:06,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:35:06,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1994836942, now seen corresponding path program 1 times [2024-10-24 16:35:06,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:35:06,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789010314] [2024-10-24 16:35:06,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:06,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:35:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:07,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:35:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:07,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 16:35:07,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:07,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 16:35:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:07,184 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 16:35:07,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:35:07,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789010314] [2024-10-24 16:35:07,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789010314] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:35:07,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408982091] [2024-10-24 16:35:07,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:07,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:35:07,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:35:07,187 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-10-24 16:35:07,189 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-10-24 16:35:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:07,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-24 16:35:07,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:35:07,726 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-10-24 16:35:07,739 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-10-24 16:35:07,761 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-10-24 16:35:07,761 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 16 treesize of output 18 [2024-10-24 16:35:07,790 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-10-24 16:35:07,793 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 16:35:07,793 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:35:07,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408982091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:35:07,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 16:35:07,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2024-10-24 16:35:07,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698975464] [2024-10-24 16:35:07,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:35:07,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:35:07,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:35:07,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:35:07,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=233, Unknown=1, NotChecked=30, Total=306 [2024-10-24 16:35:07,795 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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-10-24 16:35:07,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:35:07,949 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2024-10-24 16:35:07,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:35:07,950 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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 37 [2024-10-24 16:35:07,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:35:07,951 INFO L225 Difference]: With dead ends: 82 [2024-10-24 16:35:07,951 INFO L226 Difference]: Without dead ends: 82 [2024-10-24 16:35:07,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=293, Unknown=1, NotChecked=34, Total=380 [2024-10-24 16:35:07,952 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 6 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:35:07,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 270 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 200 Invalid, 0 Unknown, 126 Unchecked, 0.1s Time] [2024-10-24 16:35:07,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-24 16:35:07,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-24 16:35:07,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 77 states have internal predecessors, (82), 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-10-24 16:35:07,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2024-10-24 16:35:07,954 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 37 [2024-10-24 16:35:07,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:35:07,955 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2024-10-24 16:35:07,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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-10-24 16:35:07,955 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2024-10-24 16:35:07,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-24 16:35:07,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:35:07,955 INFO L215 NwaCegarLoop]: trace histogram [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-10-24 16:35:07,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-24 16:35:08,155 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,SelfDestructingSolverStorable17 [2024-10-24 16:35:08,156 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-24 16:35:08,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:35:08,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1994836943, now seen corresponding path program 1 times [2024-10-24 16:35:08,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:35:08,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416272792] [2024-10-24 16:35:08,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:08,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:35:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:08,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:35:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:08,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 16:35:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:08,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 16:35:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:08,666 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 16:35:08,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:35:08,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416272792] [2024-10-24 16:35:08,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416272792] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:35:08,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778748032] [2024-10-24 16:35:08,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:08,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:35:08,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:35:08,669 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-10-24 16:35:08,670 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-10-24 16:35:09,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:09,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-10-24 16:35:09,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:35:09,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 16:35:09,284 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-10-24 16:35:09,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:35:09,368 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 23 treesize of output 11 [2024-10-24 16:35:09,420 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:35:09,421 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-10-24 16:35:09,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-24 16:35:09,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-24 16:35:09,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-24 16:35:09,955 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 11 treesize of output 3 [2024-10-24 16:35:10,001 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-10-24 16:35:10,009 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-10-24 16:35:10,066 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_5|) 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-10-24 16:35:10,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:35:10,111 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-10-24 16:35:10,123 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-24 16:35:10,123 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 15 [2024-10-24 16:35:10,190 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-10-24 16:35:10,196 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2024-10-24 16:35:10,197 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:35:10,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778748032] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:35:10,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:35:10,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 22] total 31 [2024-10-24 16:35:10,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378147022] [2024-10-24 16:35:10,352 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:35:10,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-24 16:35:10,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:35:10,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-24 16:35:10,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1023, Unknown=1, NotChecked=64, Total=1190 [2024-10-24 16:35:10,354 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 32 states, 25 states have (on average 2.44) internal successors, (61), 26 states have internal predecessors, (61), 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-10-24 16:35:11,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:35:11,115 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2024-10-24 16:35:11,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-24 16:35:11,116 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 25 states have (on average 2.44) internal successors, (61), 26 states have internal predecessors, (61), 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 37 [2024-10-24 16:35:11,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:35:11,116 INFO L225 Difference]: With dead ends: 87 [2024-10-24 16:35:11,116 INFO L226 Difference]: Without dead ends: 87 [2024-10-24 16:35:11,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=194, Invalid=1879, Unknown=1, NotChecked=88, Total=2162 [2024-10-24 16:35:11,119 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 47 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:35:11,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 728 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 921 Invalid, 0 Unknown, 87 Unchecked, 0.5s Time] [2024-10-24 16:35:11,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-24 16:35:11,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-24 16:35:11,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 81 states have internal predecessors, (86), 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-10-24 16:35:11,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2024-10-24 16:35:11,123 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 37 [2024-10-24 16:35:11,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:35:11,123 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2024-10-24 16:35:11,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 25 states have (on average 2.44) internal successors, (61), 26 states have internal predecessors, (61), 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-10-24 16:35:11,123 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2024-10-24 16:35:11,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-24 16:35:11,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:35:11,124 INFO L215 NwaCegarLoop]: trace histogram [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-10-24 16:35:11,142 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-10-24 16:35:11,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:35:11,324 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-24 16:35:11,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:35:11,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1600516840, now seen corresponding path program 1 times [2024-10-24 16:35:11,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:35:11,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109468466] [2024-10-24 16:35:11,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:11,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:35:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:11,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:35:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:11,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 16:35:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:11,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 16:35:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:11,624 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 16:35:11,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:35:11,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109468466] [2024-10-24 16:35:11,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109468466] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:35:11,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174013655] [2024-10-24 16:35:11,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:11,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:35:11,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:35:11,627 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-10-24 16:35:11,628 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-10-24 16:35:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:11,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-24 16:35:11,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:35:11,912 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-10-24 16:35:11,917 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-10-24 16:35:11,944 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-10-24 16:35:11,947 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-10-24 16:35:12,026 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-24 16:35:12,027 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-10-24 16:35:12,053 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-24 16:35:12,054 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-10-24 16:35:12,141 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-10-24 16:35:12,145 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-10-24 16:35:12,151 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-10-24 16:35:12,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:35:12,174 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-10-24 16:35:12,187 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-24 16:35:12,187 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-10-24 16:35:12,245 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-10-24 16:35:12,261 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-10-24 16:35:12,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:35:12,283 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-10-24 16:35:12,318 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 15 not checked. [2024-10-24 16:35:12,318 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:35:12,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174013655] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:35:12,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:35:12,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2024-10-24 16:35:12,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415347152] [2024-10-24 16:35:12,431 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:35:12,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-24 16:35:12,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:35:12,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-24 16:35:12,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=360, Unknown=2, NotChecked=78, Total=506 [2024-10-24 16:35:12,432 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 21 states, 18 states have (on average 3.5) internal successors, (63), 16 states have internal predecessors, (63), 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-10-24 16:35:12,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:35:12,924 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2024-10-24 16:35:12,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 16:35:12,925 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 3.5) internal successors, (63), 16 states have internal predecessors, (63), 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 40 [2024-10-24 16:35:12,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:35:12,925 INFO L225 Difference]: With dead ends: 81 [2024-10-24 16:35:12,925 INFO L226 Difference]: Without dead ends: 81 [2024-10-24 16:35:12,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=641, Unknown=2, NotChecked=106, Total=870 [2024-10-24 16:35:12,926 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 46 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:35:12,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 444 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 551 Invalid, 0 Unknown, 150 Unchecked, 0.3s Time] [2024-10-24 16:35:12,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-24 16:35:12,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-24 16:35:12,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 75 states have internal predecessors, (79), 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-10-24 16:35:12,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2024-10-24 16:35:12,929 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 40 [2024-10-24 16:35:12,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:35:12,929 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2024-10-24 16:35:12,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 3.5) internal successors, (63), 16 states have internal predecessors, (63), 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-10-24 16:35:12,930 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2024-10-24 16:35:12,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-24 16:35:12,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:35:12,930 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 16:35:12,951 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-10-24 16:35:13,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:35:13,135 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-24 16:35:13,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:35:13,135 INFO L85 PathProgramCache]: Analyzing trace with hash -726605321, now seen corresponding path program 1 times [2024-10-24 16:35:13,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:35:13,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151850461] [2024-10-24 16:35:13,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:13,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:35:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:13,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:35:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:13,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 16:35:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:13,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 16:35:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:13,260 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-24 16:35:13,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:35:13,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151850461] [2024-10-24 16:35:13,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151850461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:35:13,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:35:13,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:35:13,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053612035] [2024-10-24 16:35:13,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:35:13,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:35:13,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:35:13,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:35:13,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:35:13,263 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-10-24 16:35:13,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:35:13,373 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-10-24 16:35:13,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:35:13,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 41 [2024-10-24 16:35:13,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:35:13,375 INFO L225 Difference]: With dead ends: 80 [2024-10-24 16:35:13,375 INFO L226 Difference]: Without dead ends: 80 [2024-10-24 16:35:13,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:35:13,376 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 1 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:35:13,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 233 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:35:13,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-24 16:35:13,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-24 16:35:13,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 74 states have internal predecessors, (78), 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-10-24 16:35:13,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2024-10-24 16:35:13,379 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 41 [2024-10-24 16:35:13,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:35:13,380 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2024-10-24 16:35:13,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-10-24 16:35:13,380 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2024-10-24 16:35:13,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-24 16:35:13,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:35:13,380 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 16:35:13,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 16:35:13,381 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-24 16:35:13,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:35:13,381 INFO L85 PathProgramCache]: Analyzing trace with hash -726605320, now seen corresponding path program 1 times [2024-10-24 16:35:13,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:35:13,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615060893] [2024-10-24 16:35:13,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:13,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:35:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:13,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:35:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:13,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 16:35:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:13,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 16:35:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:14,020 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 16:35:14,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:35:14,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615060893] [2024-10-24 16:35:14,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615060893] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:35:14,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616723804] [2024-10-24 16:35:14,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:14,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:35:14,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:35:14,023 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-10-24 16:35:14,025 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-10-24 16:35:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:14,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 16:35:14,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:35:14,342 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-10-24 16:35:14,344 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-10-24 16:35:14,373 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-24 16:35:14,373 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:35:14,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616723804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:35:14,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 16:35:14,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [15] total 18 [2024-10-24 16:35:14,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877737341] [2024-10-24 16:35:14,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:35:14,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:35:14,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:35:14,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:35:14,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-10-24 16:35:14,374 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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-10-24 16:35:14,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:35:14,449 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2024-10-24 16:35:14,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:35:14,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 41 [2024-10-24 16:35:14,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:35:14,450 INFO L225 Difference]: With dead ends: 79 [2024-10-24 16:35:14,450 INFO L226 Difference]: Without dead ends: 79 [2024-10-24 16:35:14,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-10-24 16:35:14,451 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 1 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:35:14,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 213 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:35:14,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-24 16:35:14,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-24 16:35:14,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.375) internal successors, (77), 73 states have internal predecessors, (77), 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-10-24 16:35:14,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2024-10-24 16:35:14,454 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 41 [2024-10-24 16:35:14,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:35:14,454 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2024-10-24 16:35:14,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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-10-24 16:35:14,454 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2024-10-24 16:35:14,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-24 16:35:14,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:35:14,455 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 16:35:14,474 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-10-24 16:35:14,655 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,SelfDestructingSolverStorable21 [2024-10-24 16:35:14,656 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-24 16:35:14,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:35:14,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1049928421, now seen corresponding path program 1 times [2024-10-24 16:35:14,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:35:14,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728713289] [2024-10-24 16:35:14,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:14,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:35:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:15,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:35:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:15,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 16:35:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:15,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 16:35:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:15,739 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 16:35:15,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:35:15,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728713289] [2024-10-24 16:35:15,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728713289] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:35:15,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943438748] [2024-10-24 16:35:15,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:15,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:35:15,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:35:15,742 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-10-24 16:35:15,743 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-10-24 16:35:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:16,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-10-24 16:35:16,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:35:16,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2024-10-24 16:35:16,172 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-10-24 16:35:16,178 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-24 16:35:16,178 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-10-24 16:35:16,321 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_4|) 0)) (exists ((|v_node_create_~temp~0#1.base_72| Int)) (and (= |c_#valid| (store |c_old(#valid)| |v_node_create_~temp~0#1.base_72| 1)) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_72|) 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_72| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_72|)))))) is different from true [2024-10-24 16:35:16,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:35:16,334 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-10-24 16:35:16,367 INFO L349 Elim1Store]: treesize reduction 92, result has 31.9 percent of original size [2024-10-24 16:35:16,367 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-10-24 16:35:16,499 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-24 16:35:16,499 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-10-24 16:35:16,539 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-10-24 16:35:16,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 18 treesize of output 10 [2024-10-24 16:35:16,697 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2024-10-24 16:35:16,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:35:16,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943438748] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:35:16,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:35:16,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 30 [2024-10-24 16:35:16,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664554299] [2024-10-24 16:35:16,871 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:35:16,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-24 16:35:16,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:35:16,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-24 16:35:16,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=959, Unknown=1, NotChecked=62, Total=1122 [2024-10-24 16:35:16,873 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 31 states, 25 states have (on average 2.64) internal successors, (66), 27 states have internal predecessors, (66), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 16:35:17,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:35:17,739 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2024-10-24 16:35:17,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-24 16:35:17,739 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 25 states have (on average 2.64) internal successors, (66), 27 states have internal predecessors, (66), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2024-10-24 16:35:17,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:35:17,740 INFO L225 Difference]: With dead ends: 78 [2024-10-24 16:35:17,740 INFO L226 Difference]: Without dead ends: 78 [2024-10-24 16:35:17,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=170, Invalid=1555, Unknown=1, NotChecked=80, Total=1806 [2024-10-24 16:35:17,741 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 7 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:35:17,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 608 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 662 Invalid, 0 Unknown, 81 Unchecked, 0.5s Time] [2024-10-24 16:35:17,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-24 16:35:17,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-24 16:35:17,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 72 states have internal predecessors, (76), 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-10-24 16:35:17,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-10-24 16:35:17,744 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 42 [2024-10-24 16:35:17,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:35:17,745 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-10-24 16:35:17,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 25 states have (on average 2.64) internal successors, (66), 27 states have internal predecessors, (66), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 16:35:17,745 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-10-24 16:35:17,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-24 16:35:17,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:35:17,745 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 16:35:17,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-24 16:35:17,946 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,SelfDestructingSolverStorable22 [2024-10-24 16:35:17,946 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-24 16:35:17,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:35:17,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1049928420, now seen corresponding path program 1 times [2024-10-24 16:35:17,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:35:17,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835742509] [2024-10-24 16:35:17,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:17,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:35:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:18,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:35:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:18,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 16:35:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:19,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 16:35:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:19,390 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 16:35:19,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:35:19,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835742509] [2024-10-24 16:35:19,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835742509] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:35:19,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218583991] [2024-10-24 16:35:19,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:19,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:35:19,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:35:19,394 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-10-24 16:35:19,395 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-10-24 16:35:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:19,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-10-24 16:35:19,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:35:19,687 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-10-24 16:35:19,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-24 16:35:19,910 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-24 16:35:19,911 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-10-24 16:35:19,930 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:35:19,930 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-10-24 16:35:20,145 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 19 treesize of output 11 [2024-10-24 16:35:20,161 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 27 treesize of output 1 [2024-10-24 16:35:20,215 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 43 treesize of output 19 [2024-10-24 16:35:20,224 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 11 treesize of output 3 [2024-10-24 16:35:20,229 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-10-24 16:35:20,234 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-10-24 16:35:20,410 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_prepend_~head#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_dll_circular_prepend_~head#1.offset_BEFORE_CALL_5|) 0)) (exists ((|v_node_create_~temp~0#1.base_81| Int)) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_81| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_81|))) (= (store |c_old(#length)| |v_node_create_~temp~0#1.base_81| (select |c_#length| |v_node_create_~temp~0#1.base_81|)) |c_#length|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_81|) 0) (= (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_81| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_81|)) |c_#memory_$Pointer$#1.offset|)))) is different from true [2024-10-24 16:35:20,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:35:20,424 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 51 treesize of output 34 [2024-10-24 16:35:20,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:35:20,430 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 22 treesize of output 17 [2024-10-24 16:35:20,448 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-24 16:35:20,448 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 28 treesize of output 30 [2024-10-24 16:35:20,452 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 20 treesize of output 15 [2024-10-24 16:35:20,576 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-24 16:35:20,576 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-10-24 16:35:20,636 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 41 treesize of output 17 [2024-10-24 16:35:20,644 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 11 treesize of output 3 [2024-10-24 16:35:20,690 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 8 treesize of output 4 [2024-10-24 16:35:20,738 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-24 16:35:20,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:35:21,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218583991] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:35:21,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:35:21,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 40 [2024-10-24 16:35:21,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844770638] [2024-10-24 16:35:21,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:35:21,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-24 16:35:21,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:35:21,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-24 16:35:21,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1766, Unknown=1, NotChecked=84, Total=1980 [2024-10-24 16:35:21,078 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 41 states, 32 states have (on average 2.15625) internal successors, (69), 34 states have internal predecessors, (69), 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-10-24 16:35:22,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:35:22,413 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2024-10-24 16:35:22,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-24 16:35:22,413 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 32 states have (on average 2.15625) internal successors, (69), 34 states have internal predecessors, (69), 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 42 [2024-10-24 16:35:22,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:35:22,414 INFO L225 Difference]: With dead ends: 77 [2024-10-24 16:35:22,414 INFO L226 Difference]: Without dead ends: 77 [2024-10-24 16:35:22,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=239, Invalid=3070, Unknown=1, NotChecked=112, Total=3422 [2024-10-24 16:35:22,415 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 15 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 16:35:22,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 845 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1026 Invalid, 0 Unknown, 80 Unchecked, 0.7s Time] [2024-10-24 16:35:22,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-24 16:35:22,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-24 16:35:22,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 71 states have internal predecessors, (75), 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-10-24 16:35:22,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2024-10-24 16:35:22,418 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 42 [2024-10-24 16:35:22,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:35:22,418 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2024-10-24 16:35:22,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 32 states have (on average 2.15625) internal successors, (69), 34 states have internal predecessors, (69), 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-10-24 16:35:22,418 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2024-10-24 16:35:22,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-24 16:35:22,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:35:22,419 INFO L215 NwaCegarLoop]: trace histogram [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-10-24 16:35:22,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-24 16:35:22,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:35:22,620 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-24 16:35:22,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:35:22,620 INFO L85 PathProgramCache]: Analyzing trace with hash 876997640, now seen corresponding path program 1 times [2024-10-24 16:35:22,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:35:22,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988527696] [2024-10-24 16:35:22,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:22,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:35:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:22,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:35:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:22,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 16:35:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:22,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 16:35:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:22,891 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-24 16:35:22,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:35:22,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988527696] [2024-10-24 16:35:22,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988527696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:35:22,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:35:22,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 16:35:22,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533458981] [2024-10-24 16:35:22,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:35:22,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 16:35:22,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:35:22,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 16:35:22,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:35:22,895 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 10 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 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-10-24 16:35:23,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:35:23,080 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2024-10-24 16:35:23,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:35:23,081 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 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 46 [2024-10-24 16:35:23,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:35:23,081 INFO L225 Difference]: With dead ends: 81 [2024-10-24 16:35:23,081 INFO L226 Difference]: Without dead ends: 81 [2024-10-24 16:35:23,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:35:23,082 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 28 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:35:23,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 302 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:35:23,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-24 16:35:23,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2024-10-24 16:35:23,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 71 states have internal predecessors, (76), 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-10-24 16:35:23,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2024-10-24 16:35:23,085 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 46 [2024-10-24 16:35:23,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:35:23,085 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2024-10-24 16:35:23,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 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-10-24 16:35:23,085 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2024-10-24 16:35:23,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-24 16:35:23,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:35:23,086 INFO L215 NwaCegarLoop]: trace histogram [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-10-24 16:35:23,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 16:35:23,086 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-24 16:35:23,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:35:23,087 INFO L85 PathProgramCache]: Analyzing trace with hash 876997641, now seen corresponding path program 1 times [2024-10-24 16:35:23,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:35:23,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280352544] [2024-10-24 16:35:23,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:23,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:35:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:23,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:35:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:23,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 16:35:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:23,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 16:35:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:23,504 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 16:35:23,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:35:23,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280352544] [2024-10-24 16:35:23,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280352544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:35:23,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:35:23,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 16:35:23,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180106240] [2024-10-24 16:35:23,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:35:23,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 16:35:23,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:35:23,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 16:35:23,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:35:23,507 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 10 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 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-10-24 16:35:23,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:35:23,671 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2024-10-24 16:35:23,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:35:23,671 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 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 46 [2024-10-24 16:35:23,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:35:23,672 INFO L225 Difference]: With dead ends: 83 [2024-10-24 16:35:23,672 INFO L226 Difference]: Without dead ends: 83 [2024-10-24 16:35:23,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-24 16:35:23,673 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 29 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:35:23,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 273 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:35:23,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-24 16:35:23,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2024-10-24 16:35:23,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 73 states have internal predecessors, (78), 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-10-24 16:35:23,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2024-10-24 16:35:23,676 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 46 [2024-10-24 16:35:23,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:35:23,676 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2024-10-24 16:35:23,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 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-10-24 16:35:23,676 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2024-10-24 16:35:23,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-24 16:35:23,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:35:23,677 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 16:35:23,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-24 16:35:23,677 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-24 16:35:23,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:35:23,677 INFO L85 PathProgramCache]: Analyzing trace with hash -2013066708, now seen corresponding path program 1 times [2024-10-24 16:35:23,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:35:23,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024621176] [2024-10-24 16:35:23,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:23,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:35:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:25,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:35:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:25,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 16:35:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:25,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 16:35:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:25,986 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 16:35:25,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:35:25,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024621176] [2024-10-24 16:35:25,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024621176] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:35:25,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322623495] [2024-10-24 16:35:25,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:25,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:35:25,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:35:25,988 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-10-24 16:35:25,989 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-10-24 16:35:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:26,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-10-24 16:35:26,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:35:26,462 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 39 treesize of output 1 [2024-10-24 16:35:26,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 19 treesize of output 5 [2024-10-24 16:35:26,533 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-24 16:35:26,533 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-10-24 16:35:26,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-24 16:35:26,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:35:26,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2024-10-24 16:35:26,721 INFO L349 Elim1Store]: treesize reduction 34, result has 44.3 percent of original size [2024-10-24 16:35:26,721 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 34 treesize of output 36 [2024-10-24 16:35:26,928 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:35:26,933 INFO L349 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2024-10-24 16:35:26,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 11 [2024-10-24 16:35:27,062 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 15 [2024-10-24 16:35:27,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:35:27,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:35:27,149 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-10-24 16:35:27,159 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-10-24 16:35:27,212 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-10-24 16:35:27,256 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-10-24 16:35:27,310 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-10-24 16:35:27,313 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-10-24 16:35:27,410 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 16:35:27,410 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:35:27,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322623495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:35:27,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 16:35:27,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [30] total 51 [2024-10-24 16:35:27,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068547813] [2024-10-24 16:35:27,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:35:27,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-24 16:35:27,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:35:27,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-24 16:35:27,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2385, Unknown=0, NotChecked=0, Total=2550 [2024-10-24 16:35:27,412 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 22 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 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-10-24 16:35:27,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:35:27,790 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2024-10-24 16:35:27,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-24 16:35:27,790 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 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 50 [2024-10-24 16:35:27,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:35:27,791 INFO L225 Difference]: With dead ends: 83 [2024-10-24 16:35:27,791 INFO L226 Difference]: Without dead ends: 83 [2024-10-24 16:35:27,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=190, Invalid=2780, Unknown=0, NotChecked=0, Total=2970 [2024-10-24 16:35:27,792 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 47 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:35:27,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 553 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:35:27,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-24 16:35:27,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2024-10-24 16:35:27,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 59 states have (on average 1.305084745762712) internal successors, (77), 73 states have internal predecessors, (77), 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-10-24 16:35:27,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2024-10-24 16:35:27,794 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 50 [2024-10-24 16:35:27,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:35:27,795 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2024-10-24 16:35:27,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 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-10-24 16:35:27,795 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2024-10-24 16:35:27,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-24 16:35:27,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:35:27,795 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 16:35:27,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-24 16:35:27,996 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,SelfDestructingSolverStorable26 [2024-10-24 16:35:27,996 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-24 16:35:27,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:35:27,996 INFO L85 PathProgramCache]: Analyzing trace with hash 2022445768, now seen corresponding path program 1 times [2024-10-24 16:35:27,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:35:27,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082384374] [2024-10-24 16:35:27,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:27,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:35:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:29,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:35:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:29,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 16:35:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:29,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 16:35:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:29,507 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 16:35:29,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:35:29,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082384374] [2024-10-24 16:35:29,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082384374] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:35:29,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007993247] [2024-10-24 16:35:29,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:29,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:35:29,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:35:29,510 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-10-24 16:35:29,511 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-10-24 16:35:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:29,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-10-24 16:35:29,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:35:29,905 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 39 treesize of output 1 [2024-10-24 16:35:29,946 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 5 [2024-10-24 16:35:29,949 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-24 16:35:29,949 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-10-24 16:35:30,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:35:30,064 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 28 treesize of output 23 [2024-10-24 16:35:30,077 INFO L349 Elim1Store]: treesize reduction 34, result has 44.3 percent of original size [2024-10-24 16:35:30,077 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 34 treesize of output 36 [2024-10-24 16:35:30,356 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 62 treesize of output 42 [2024-10-24 16:35:30,361 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 39 treesize of output 27 [2024-10-24 16:35:30,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2024-10-24 16:35:30,527 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2024-10-24 16:35:30,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 40 [2024-10-24 16:35:30,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-24 16:35:30,587 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-10-24 16:35:30,637 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 77 treesize of output 29 [2024-10-24 16:35:30,678 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 45 treesize of output 29 [2024-10-24 16:35:30,681 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 33 treesize of output 21 [2024-10-24 16:35:30,737 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-10-24 16:35:30,742 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 16:35:30,742 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:35:38,854 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4856 Int) (v_ArrVal_4854 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4854))) (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|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4856))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2024-10-24 16:35:38,869 INFO L349 Elim1Store]: treesize reduction 5, result has 88.1 percent of original size [2024-10-24 16:35:38,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2024-10-24 16:35:38,875 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4856 Int) (v_ArrVal_4853 (Array Int Int)) (v_ArrVal_4854 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4853) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4854))) (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|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4856))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (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-10-24 16:35:38,890 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4856 Int) (v_ArrVal_4853 (Array Int Int)) (v_ArrVal_4854 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4853) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4854) |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|) |c_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_4853) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4854) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4856)) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base|)) is different from false [2024-10-24 16:35:38,905 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_4856 Int) (v_ArrVal_4853 (Array Int Int)) (v_ArrVal_4854 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4853) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4854) |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_4853) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4854) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4856)) (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|)) (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| |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_dll_circular_prepend_~old_head~0#1.base|)) is different from false [2024-10-24 16:35:38,920 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_4856 Int) (v_ArrVal_4853 (Array Int Int)) (v_ArrVal_4854 (Array Int 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|))) (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_4853) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4854) |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| .cse0)) .cse0 v_ArrVal_4853) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4854) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4856)) (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|)) (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| |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|)) .cse0)))) is different from false [2024-10-24 16:35:39,425 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_4856 Int) (v_ArrVal_4853 (Array Int Int)) (v_ArrVal_4854 (Array Int 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|))) (= (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (store (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_4853) .cse1 v_ArrVal_4854) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse0)) .cse0 v_ArrVal_4853) .cse1 v_ArrVal_4854) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4856))) (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_#t~ret9#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |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|))) .cse0)))) is different from false [2024-10-24 16:35:39,469 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4861 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_4856 Int) (v_ArrVal_4853 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_26| Int) (v_ArrVal_4854 (Array Int Int))) (or (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|))) (= (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (select (select (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_26| v_ArrVal_4861) .cse0) (+ (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (store (store (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_4853) .cse1 v_ArrVal_4854) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_26| (store (select (store (store (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_26| (store v_ArrVal_4861 |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse0)) .cse0 v_ArrVal_4853) .cse1 v_ArrVal_4854) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_26|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4856))) (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| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_26|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |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|))) .cse0))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_26|) 0)))) is different from false [2024-10-24 16:35:39,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007993247] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:35:39,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:35:39,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 40 [2024-10-24 16:35:39,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207056123] [2024-10-24 16:35:39,472 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:35:39,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-24 16:35:39,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:35:39,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-24 16:35:39,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1740, Unknown=48, NotChecked=630, Total=2550 [2024-10-24 16:35:39,474 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 41 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 36 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 16:35:40,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:35:40,591 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2024-10-24 16:35:40,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-24 16:35:40,591 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 36 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 51 [2024-10-24 16:35:40,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:35:40,592 INFO L225 Difference]: With dead ends: 86 [2024-10-24 16:35:40,592 INFO L226 Difference]: Without dead ends: 86 [2024-10-24 16:35:40,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=228, Invalid=2944, Unknown=48, NotChecked=812, Total=4032 [2024-10-24 16:35:40,593 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 62 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 16:35:40,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 932 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 16:35:40,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-24 16:35:40,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2024-10-24 16:35:40,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 76 states have internal predecessors, (82), 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-10-24 16:35:40,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2024-10-24 16:35:40,596 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 51 [2024-10-24 16:35:40,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:35:40,596 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2024-10-24 16:35:40,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 36 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 16:35:40,597 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2024-10-24 16:35:40,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-24 16:35:40,597 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:35:40,597 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 16:35:40,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-10-24 16:35:40,798 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-10-24 16:35:40,798 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-24 16:35:40,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:35:40,799 INFO L85 PathProgramCache]: Analyzing trace with hash 2022445769, now seen corresponding path program 1 times [2024-10-24 16:35:40,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:35:40,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458899615] [2024-10-24 16:35:40,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:40,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:35:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:42,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:35:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:42,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 16:35:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:43,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 16:35:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:43,253 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 16:35:43,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:35:43,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458899615] [2024-10-24 16:35:43,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458899615] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:35:43,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080276812] [2024-10-24 16:35:43,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:43,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:35:43,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:35:43,256 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-10-24 16:35:43,258 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-10-24 16:35:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:43,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-10-24 16:35:43,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:35:43,654 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-10-24 16:35:43,893 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 27 treesize of output 1 [2024-10-24 16:35:43,946 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-10-24 16:35:43,951 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-24 16:35:43,951 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-10-24 16:35:43,953 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-10-24 16:35:44,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:35:44,177 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-10-24 16:35:44,192 INFO L349 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2024-10-24 16:35:44,192 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-10-24 16:35:44,200 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 18 treesize of output 13 [2024-10-24 16:35:44,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2024-10-24 16:35:44,662 INFO L349 Elim1Store]: treesize reduction 29, result has 34.1 percent of original size [2024-10-24 16:35:44,662 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-10-24 16:35:44,737 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-10-24 16:35:44,745 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-10-24 16:35:44,863 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2024-10-24 16:35:44,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 50 [2024-10-24 16:35:44,868 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-10-24 16:35:44,878 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-10-24 16:35:44,947 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-10-24 16:35:44,954 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-10-24 16:35:45,015 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 55 treesize of output 19 [2024-10-24 16:35:45,019 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 77 treesize of output 29 [2024-10-24 16:35:45,081 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 60 treesize of output 40 [2024-10-24 16:35:45,084 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 44 treesize of output 28 [2024-10-24 16:35:45,163 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-10-24 16:35:45,167 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-10-24 16:35:45,219 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:35:45,219 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:35:45,557 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_5169 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (<= 0 (+ 8 (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5169))) (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)))) (forall ((v_ArrVal_5171 Int) (v_ArrVal_5169 (Array Int Int)) (v_ArrVal_5168 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~last~1#1.offset| Int)) (<= (+ 12 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5169))) (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)) (select |c_#length| (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5168))) (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 v_ArrVal_5171))) .cse2) .cse3)))))) is different from false [2024-10-24 16:35:45,591 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_5167 (Array Int Int)) (v_ArrVal_5166 (Array Int Int)) (v_ArrVal_5171 Int) (v_ArrVal_5169 (Array Int Int)) (v_ArrVal_5168 (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_5166) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5169))) (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_5167) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5168))) (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 v_ArrVal_5171))) .cse2) .cse3)))) (forall ((v_ArrVal_5166 (Array Int Int)) (v_ArrVal_5169 (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_5166) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5169))) (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-10-24 16:35:45,624 INFO L349 Elim1Store]: treesize reduction 31, result has 58.1 percent of original size [2024-10-24 16:35:45,625 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 1330 treesize of output 1284 [2024-10-24 16:35:45,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:35:45,649 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 2598 treesize of output 2586 [2024-10-24 16:35:45,676 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 1684 treesize of output 1654 [2024-10-24 16:35:45,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2182 treesize of output 2122 [2024-10-24 16:35:46,060 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 55 treesize of output 49 [2024-10-24 16:35:46,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:35:46,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 491 treesize of output 471 [2024-10-24 16:35:46,807 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:35:46,808 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:35:46,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:35:46,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:35:46,815 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 32 treesize of output 33 [2024-10-24 16:35:46,819 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:35:46,819 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:35:46,822 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 27 treesize of output 23 [2024-10-24 16:35:46,824 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:35:46,827 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 18 treesize of output 10 [2024-10-24 16:35:47,128 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.offset| 11)) (.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (.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|)) (.cse2 (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)) (forall ((v_prenex_12 Int) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_prenex_13 (Array Int Int)) (v_prenex_11 (Array Int Int))) (<= (+ |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.offset| 12) (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_prenex_11) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_prenex_13) |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 .cse1 |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_prenex_11) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_prenex_13) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_prenex_12)) .cse0) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |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|))))) (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 .cse2 |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 ((v_ArrVal_5167 (Array Int Int)) (v_ArrVal_5171 Int) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_5168 (Array Int Int))) (< .cse3 (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_5167) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5168) |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 .cse1 |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_5167) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5168) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_5171)) .cse0) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |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|))))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_10 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_prenex_9 Int)) (< .cse3 (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_prenex_8) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_prenex_10) |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 .cse1 |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_prenex_8) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_prenex_9)) .cse0) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |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-10-24 16:35:47,173 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|)) (.cse5 (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (let ((.cse0 (+ .cse5 11)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (.cse1 (select .cse6 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse3 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse6 |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|))) (and (not (= |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_10 (Array Int Int)) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_prenex_9 Int)) (< .cse0 (select |c_#length| (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse1 v_prenex_8) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_prenex_10) |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 .cse2 |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse1)) .cse1 v_prenex_8) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_prenex_9)) .cse3) (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| |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|))))) (= .cse3 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (<= 0 (+ .cse5 8)) (forall ((v_ArrVal_5167 (Array Int Int)) (v_ArrVal_5171 Int) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_5168 (Array Int Int))) (< .cse0 (select |c_#length| (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_5167) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5168) |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 .cse2 |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse1)) .cse1 v_ArrVal_5167) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_5168) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_5171)) .cse3) (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| |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|))))) (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 .cse4 |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 (= .cse3 .cse1)) (forall ((v_prenex_12 Int) (|ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| Int) (v_prenex_13 (Array Int Int)) (v_prenex_11 (Array Int Int))) (<= (+ .cse5 12) (select |c_#length| (select (select (store (store (store |c_#memory_$Pointer$#1.base| .cse1 v_prenex_11) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_prenex_13) |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 .cse2 |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| .cse1)) .cse1 v_prenex_11) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_prenex_13) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_prenex_12)) .cse3) (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| |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-10-24 16:35:49,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080276812] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:35:49,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:35:49,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2024-10-24 16:35:49,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54706971] [2024-10-24 16:35:49,741 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:35:49,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-24 16:35:49,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:35:49,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-24 16:35:49,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=3262, Unknown=4, NotChecked=468, Total=3906 [2024-10-24 16:35:49,744 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 50 states, 43 states have (on average 1.930232558139535) internal successors, (83), 44 states have internal predecessors, (83), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 16:35:52,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:35:52,656 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2024-10-24 16:35:52,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-24 16:35:52,657 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 43 states have (on average 1.930232558139535) internal successors, (83), 44 states have internal predecessors, (83), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 51 [2024-10-24 16:35:52,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:35:52,657 INFO L225 Difference]: With dead ends: 88 [2024-10-24 16:35:52,657 INFO L226 Difference]: Without dead ends: 88 [2024-10-24 16:35:52,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=345, Invalid=5987, Unknown=4, NotChecked=636, Total=6972 [2024-10-24 16:35:52,659 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 70 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 1787 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 1794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:35:52,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1374 Invalid, 1794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1787 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 16:35:52,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-24 16:35:52,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2024-10-24 16:35:52,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.3125) internal successors, (84), 78 states have internal predecessors, (84), 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-10-24 16:35:52,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2024-10-24 16:35:52,663 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 51 [2024-10-24 16:35:52,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:35:52,663 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2024-10-24 16:35:52,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 43 states have (on average 1.930232558139535) internal successors, (83), 44 states have internal predecessors, (83), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 16:35:52,663 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2024-10-24 16:35:52,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-24 16:35:52,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:35:52,664 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 16:35:52,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-10-24 16:35:52,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-24 16:35:52,865 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-24 16:35:52,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:35:52,865 INFO L85 PathProgramCache]: Analyzing trace with hash 879711911, now seen corresponding path program 1 times [2024-10-24 16:35:52,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:35:52,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251014073] [2024-10-24 16:35:52,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:52,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:35:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:54,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:35:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:54,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 16:35:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:54,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 16:35:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:54,276 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 16:35:54,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:35:54,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251014073] [2024-10-24 16:35:54,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251014073] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:35:54,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783562667] [2024-10-24 16:35:54,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:35:54,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:35:54,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:35:54,278 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:35:54,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-24 16:35:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:35:54,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-10-24 16:35:54,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:35:54,733 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 39 treesize of output 1 [2024-10-24 16:35:54,785 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 5 [2024-10-24 16:35:54,790 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-24 16:35:54,790 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-10-24 16:35:54,892 INFO L349 Elim1Store]: treesize reduction 34, result has 44.3 percent of original size [2024-10-24 16:35:54,892 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 34 treesize of output 36 [2024-10-24 16:35:58,908 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (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_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse0)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_49| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_49| |c_#memory_$Pointer$#1.base|))) (and (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_49| .cse0) .cse1))) (= .cse2 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_49| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2)))))) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1))))))) is different from false [2024-10-24 16:35:58,911 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (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_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| .cse0)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_49| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_49| |c_#memory_$Pointer$#1.base|))) (and (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_49| .cse0) .cse1))) (= .cse2 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_49| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2)))))) (not (= |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1))))))) is different from true [2024-10-24 16:35:59,137 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 62 treesize of output 42 [2024-10-24 16:35:59,143 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 39 treesize of output 27 [2024-10-24 16:35:59,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2024-10-24 16:35:59,266 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2024-10-24 16:35:59,267 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 52 treesize of output 41 [2024-10-24 16:35:59,270 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 16 treesize of output 8 [2024-10-24 16:35:59,304 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 21 treesize of output 16 [2024-10-24 16:35:59,310 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 60 treesize of output 24 [2024-10-24 16:35:59,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-10-24 16:35:59,392 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 12 [2024-10-24 16:35:59,397 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-10-24 16:35:59,400 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 16:35:59,400 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:35:59,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783562667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:35:59,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 16:35:59,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [27] total 40 [2024-10-24 16:35:59,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048701166] [2024-10-24 16:35:59,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:35:59,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-24 16:35:59,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:35:59,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-24 16:35:59,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1374, Unknown=2, NotChecked=74, Total=1560 [2024-10-24 16:35:59,402 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 23 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 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-10-24 16:35:59,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:35:59,893 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2024-10-24 16:35:59,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-24 16:35:59,894 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 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 54 [2024-10-24 16:35:59,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:35:59,894 INFO L225 Difference]: With dead ends: 88 [2024-10-24 16:35:59,895 INFO L226 Difference]: Without dead ends: 88 [2024-10-24 16:35:59,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=125, Invalid=1599, Unknown=2, NotChecked=80, Total=1806 [2024-10-24 16:35:59,896 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 36 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:35:59,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 730 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 670 Invalid, 0 Unknown, 106 Unchecked, 0.4s Time] [2024-10-24 16:35:59,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-24 16:35:59,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2024-10-24 16:35:59,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.296875) internal successors, (83), 78 states have internal predecessors, (83), 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-10-24 16:35:59,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2024-10-24 16:35:59,899 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 54 [2024-10-24 16:35:59,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:35:59,899 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2024-10-24 16:35:59,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 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-10-24 16:35:59,899 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2024-10-24 16:35:59,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 16:35:59,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:35:59,900 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:35:59,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-10-24 16:36:00,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:36:00,101 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2024-10-24 16:36:00,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:36:00,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1532481772, now seen corresponding path program 1 times [2024-10-24 16:36:00,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:36:00,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869149389] [2024-10-24 16:36:00,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:36:00,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:36:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:36:02,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:36:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:36:02,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-24 16:36:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:36:02,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 16:36:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:36:03,009 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 16:36:03,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:36:03,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869149389] [2024-10-24 16:36:03,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869149389] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:36:03,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230659723] [2024-10-24 16:36:03,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:36:03,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:36:03,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:36:03,014 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:36:03,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-24 16:36:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:36:03,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 165 conjuncts are in the unsatisfiable core [2024-10-24 16:36:03,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:36:03,436 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-10-24 16:36:03,626 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 12 treesize of output 14 [2024-10-24 16:36:03,828 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-10-24 16:36:03,905 INFO L349 Elim1Store]: treesize reduction 28, result has 26.3 percent of original size [2024-10-24 16:36:03,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 24 [2024-10-24 16:36:04,044 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 23 treesize of output 11 [2024-10-24 16:36: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 16 treesize of output 11 [2024-10-24 16:36:04,291 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-10-24 16:36:04,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 39 treesize of output 15 [2024-10-24 16:36:04,316 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 27 treesize of output 1