./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/list-simple/dll2c_remove_all.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/list-simple/dll2c_remove_all.c -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 92a3f2fba092ce96d6f40cfa399a7aa6150c02c4ed8351247adde579d937e16e --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:19:13,742 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:19:13,792 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:19:13,797 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:19:13,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:19:13,820 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:19:13,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:19:13,820 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:19:13,821 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:19:13,821 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:19:13,821 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:19:13,821 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:19:13,821 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:19:13,823 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:19:13,823 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:19:13,824 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:19:13,824 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:19:13,824 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:19:13,824 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:19:13,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:19:13,824 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:19:13,824 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:19:13,824 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:19:13,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:19:13,824 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:19:13,824 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:19:13,824 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:19:13,824 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:19:13,824 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:19:13,824 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:19:13,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:19:13,824 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:19:13,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:19:13,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:19:13,824 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:19:13,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:19:13,824 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:19:13,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:19:13,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:19:13,825 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:19:13,825 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:19:13,825 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:19:13,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:19:13,825 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:19:13,825 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:19:13,825 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:19:13,825 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 92a3f2fba092ce96d6f40cfa399a7aa6150c02c4ed8351247adde579d937e16e [2025-04-29 11:19:14,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:19:14,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:19:14,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:19:14,051 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:19:14,052 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:19:14,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_remove_all.c [2025-04-29 11:19:15,300 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd1b510d8/2ba8c0aca91f4437ace2f74ff77c9f46/FLAGb1fa8c4df [2025-04-29 11:19:15,488 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:19:15,488 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_remove_all.c [2025-04-29 11:19:15,490 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:19:15,490 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:19:15,495 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd1b510d8/2ba8c0aca91f4437ace2f74ff77c9f46/FLAGb1fa8c4df [2025-04-29 11:19:16,452 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd1b510d8/2ba8c0aca91f4437ace2f74ff77c9f46 [2025-04-29 11:19:16,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:19:16,455 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:19:16,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:19:16,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:19:16,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:19:16,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:19:16" (1/1) ... [2025-04-29 11:19:16,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@260cc4d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:16, skipping insertion in model container [2025-04-29 11:19:16,462 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:19:16" (1/1) ... [2025-04-29 11:19:16,471 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:19:16,627 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:19:16,637 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:19:16,669 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:19:16,682 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:19:16,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:16 WrapperNode [2025-04-29 11:19:16,683 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:19:16,684 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:19:16,684 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:19:16,684 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:19:16,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:16" (1/1) ... [2025-04-29 11:19:16,698 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:16" (1/1) ... [2025-04-29 11:19:16,716 INFO L138 Inliner]: procedures = 17, calls = 35, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 103 [2025-04-29 11:19:16,718 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:19:16,719 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:19:16,719 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:19:16,719 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:19:16,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:16" (1/1) ... [2025-04-29 11:19:16,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:16" (1/1) ... [2025-04-29 11:19:16,726 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:16" (1/1) ... [2025-04-29 11:19:16,737 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [9, 11]. 55 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1, 0]. The 11 writes are split as follows [2, 9]. [2025-04-29 11:19:16,737 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:16" (1/1) ... [2025-04-29 11:19:16,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:16" (1/1) ... [2025-04-29 11:19:16,742 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:16" (1/1) ... [2025-04-29 11:19:16,743 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:16" (1/1) ... [2025-04-29 11:19:16,747 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:16" (1/1) ... [2025-04-29 11:19:16,748 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:16" (1/1) ... [2025-04-29 11:19:16,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:16" (1/1) ... [2025-04-29 11:19:16,755 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:19:16,756 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:19:16,756 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:19:16,756 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:19:16,757 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:16" (1/1) ... [2025-04-29 11:19:16,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:19:16,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:16,780 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) [2025-04-29 11:19:16,781 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 [2025-04-29 11:19:16,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:19:16,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:19:16,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 11:19:16,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 11:19:16,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:19:16,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:19:16,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 11:19:16,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:19:16,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:19:16,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:19:16,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:19:16,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:19:16,797 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-04-29 11:19:16,797 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-04-29 11:19:16,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:19:16,850 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:19:16,851 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:19:17,098 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2025-04-29 11:19:17,098 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:19:17,107 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:19:17,108 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:19:17,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:19:17 BoogieIcfgContainer [2025-04-29 11:19:17,108 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:19:17,109 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:19:17,109 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:19:17,113 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:19:17,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:19:16" (1/3) ... [2025-04-29 11:19:17,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@218da25c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:19:17, skipping insertion in model container [2025-04-29 11:19:17,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:16" (2/3) ... [2025-04-29 11:19:17,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@218da25c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:19:17, skipping insertion in model container [2025-04-29 11:19:17,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:19:17" (3/3) ... [2025-04-29 11:19:17,116 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all.c [2025-04-29 11:19:17,125 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:19:17,126 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_remove_all.c that has 2 procedures, 99 locations, 107 edges, 1 initial locations, 2 loop locations, and 45 error locations. [2025-04-29 11:19:17,155 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:19:17,164 INFO L340 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;@31b8cb27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:19:17,164 INFO L341 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2025-04-29 11:19:17,168 INFO L278 IsEmpty]: Start isEmpty. Operand has 99 states, 50 states have (on average 2.02) internal successors, (101), 95 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:17,172 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:19:17,172 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:17,173 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:19:17,173 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:17,177 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:17,177 INFO L85 PathProgramCache]: Analyzing trace with hash 893394546, now seen corresponding path program 1 times [2025-04-29 11:19:17,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:17,183 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616476460] [2025-04-29 11:19:17,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:17,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:17,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:19:17,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:19:17,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:17,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:17,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:17,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:17,335 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616476460] [2025-04-29 11:19:17,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616476460] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:17,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:17,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:19:17,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460163852] [2025-04-29 11:19:17,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:17,340 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:19:17,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:17,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:19:17,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:19:17,358 INFO L87 Difference]: Start difference. First operand has 99 states, 50 states have (on average 2.02) internal successors, (101), 95 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:17,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:17,445 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2025-04-29 11:19:17,446 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:19:17,447 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-04-29 11:19:17,447 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:17,451 INFO L225 Difference]: With dead ends: 95 [2025-04-29 11:19:17,451 INFO L226 Difference]: Without dead ends: 91 [2025-04-29 11:19:17,452 INFO L436 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 [2025-04-29 11:19:17,454 INFO L437 NwaCegarLoop]: 91 mSDtfsCounter, 3 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:17,454 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 140 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:17,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-04-29 11:19:17,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-04-29 11:19:17,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 87 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:17,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2025-04-29 11:19:17,480 INFO L79 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 6 [2025-04-29 11:19:17,480 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:17,481 INFO L485 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2025-04-29 11:19:17,481 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:17,481 INFO L278 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2025-04-29 11:19:17,481 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:19:17,482 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:17,482 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:19:17,482 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:19:17,482 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:17,483 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:17,483 INFO L85 PathProgramCache]: Analyzing trace with hash 893394547, now seen corresponding path program 1 times [2025-04-29 11:19:17,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:17,483 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767535675] [2025-04-29 11:19:17,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:17,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:17,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:19:17,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:19:17,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:17,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:17,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:17,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:17,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767535675] [2025-04-29 11:19:17,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767535675] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:17,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:17,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:19:17,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524267374] [2025-04-29 11:19:17,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:17,608 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:19:17,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:17,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:19:17,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:19:17,613 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:17,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:17,664 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2025-04-29 11:19:17,664 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:19:17,664 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-04-29 11:19:17,665 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:17,665 INFO L225 Difference]: With dead ends: 88 [2025-04-29 11:19:17,665 INFO L226 Difference]: Without dead ends: 88 [2025-04-29 11:19:17,665 INFO L436 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 [2025-04-29 11:19:17,666 INFO L437 NwaCegarLoop]: 87 mSDtfsCounter, 3 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:17,666 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 140 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:19:17,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-04-29 11:19:17,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-04-29 11:19:17,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 84 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:17,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2025-04-29 11:19:17,671 INFO L79 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 6 [2025-04-29 11:19:17,671 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:17,671 INFO L485 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2025-04-29 11:19:17,671 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:17,671 INFO L278 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2025-04-29 11:19:17,672 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:19:17,672 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:17,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:17,672 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:19:17,672 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:17,672 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:17,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1115583926, now seen corresponding path program 1 times [2025-04-29 11:19:17,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:17,672 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001033415] [2025-04-29 11:19:17,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:17,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:17,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:19:17,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:19:17,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:17,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:17,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:17,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:17,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001033415] [2025-04-29 11:19:17,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001033415] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:17,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:17,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:19:17,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922183337] [2025-04-29 11:19:17,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:17,762 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:19:17,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:17,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:19:17,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:19:17,766 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:19:17,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:17,776 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2025-04-29 11:19:17,776 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:19:17,776 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-04-29 11:19:17,777 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:17,777 INFO L225 Difference]: With dead ends: 99 [2025-04-29 11:19:17,777 INFO L226 Difference]: Without dead ends: 99 [2025-04-29 11:19:17,777 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:19:17,778 INFO L437 NwaCegarLoop]: 90 mSDtfsCounter, 10 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:17,778 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 175 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:19:17,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-04-29 11:19:17,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2025-04-29 11:19:17,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 85 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:17,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2025-04-29 11:19:17,783 INFO L79 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 14 [2025-04-29 11:19:17,783 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:17,783 INFO L485 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2025-04-29 11:19:17,783 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:19:17,783 INFO L278 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2025-04-29 11:19:17,783 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:19:17,784 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:17,784 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:17,784 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:19:17,784 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:17,784 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:17,784 INFO L85 PathProgramCache]: Analyzing trace with hash 138655973, now seen corresponding path program 1 times [2025-04-29 11:19:17,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:17,784 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290300093] [2025-04-29 11:19:17,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:17,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:17,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:19:17,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:19:17,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:17,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:17,912 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:19:17,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:17,912 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290300093] [2025-04-29 11:19:17,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290300093] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:17,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:17,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:19:17,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020050411] [2025-04-29 11:19:17,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:17,913 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:19:17,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:17,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:19:17,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:17,914 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:18,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:18,044 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2025-04-29 11:19:18,045 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:19:18,045 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-04-29 11:19:18,045 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:18,046 INFO L225 Difference]: With dead ends: 88 [2025-04-29 11:19:18,046 INFO L226 Difference]: Without dead ends: 88 [2025-04-29 11:19:18,046 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:18,046 INFO L437 NwaCegarLoop]: 80 mSDtfsCounter, 7 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:18,046 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 238 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:18,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-04-29 11:19:18,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-04-29 11:19:18,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 47 states have (on average 1.872340425531915) internal successors, (88), 84 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:18,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2025-04-29 11:19:18,050 INFO L79 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 24 [2025-04-29 11:19:18,050 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:18,050 INFO L485 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2025-04-29 11:19:18,050 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:18,050 INFO L278 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2025-04-29 11:19:18,051 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:19:18,051 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:18,051 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:18,051 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:19:18,051 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:18,051 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:18,052 INFO L85 PathProgramCache]: Analyzing trace with hash 138655974, now seen corresponding path program 1 times [2025-04-29 11:19:18,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:18,052 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361408314] [2025-04-29 11:19:18,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:18,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:18,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:19:18,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:19:18,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:18,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:18,265 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:19:18,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:18,266 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361408314] [2025-04-29 11:19:18,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361408314] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:18,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:18,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:19:18,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180929893] [2025-04-29 11:19:18,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:18,267 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:19:18,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:18,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:19:18,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:18,270 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:18,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:18,375 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2025-04-29 11:19:18,375 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:19:18,375 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-04-29 11:19:18,375 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:18,377 INFO L225 Difference]: With dead ends: 87 [2025-04-29 11:19:18,377 INFO L226 Difference]: Without dead ends: 87 [2025-04-29 11:19:18,377 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:18,378 INFO L437 NwaCegarLoop]: 80 mSDtfsCounter, 6 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:18,379 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 266 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:18,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-04-29 11:19:18,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-04-29 11:19:18,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 47 states have (on average 1.851063829787234) internal successors, (87), 83 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:18,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2025-04-29 11:19:18,385 INFO L79 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 24 [2025-04-29 11:19:18,385 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:18,385 INFO L485 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2025-04-29 11:19:18,385 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:18,386 INFO L278 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2025-04-29 11:19:18,386 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:19:18,386 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:18,386 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:18,386 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:19:18,386 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:18,386 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:18,386 INFO L85 PathProgramCache]: Analyzing trace with hash 104403430, now seen corresponding path program 1 times [2025-04-29 11:19:18,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:18,387 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071710573] [2025-04-29 11:19:18,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:18,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:18,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:19:18,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:19:18,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:18,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:18,604 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:18,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:18,605 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071710573] [2025-04-29 11:19:18,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071710573] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:18,605 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169199165] [2025-04-29 11:19:18,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:18,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:18,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:18,608 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) [2025-04-29 11:19:18,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:19:18,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:19:18,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:19:18,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:18,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:18,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-29 11:19:18,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:18,724 INFO L354 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 [2025-04-29 11:19:18,790 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:19:18,791 INFO L354 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 [2025-04-29 11:19:18,836 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:18,836 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:19,119 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:19,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169199165] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:19:19,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:19:19,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2025-04-29 11:19:19,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833206155] [2025-04-29 11:19:19,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:19,120 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:19:19,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:19,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:19:19,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:19:19,121 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 11:19:19,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:19,459 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2025-04-29 11:19:19,460 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:19:19,460 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2025-04-29 11:19:19,460 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:19,462 INFO L225 Difference]: With dead ends: 92 [2025-04-29 11:19:19,462 INFO L226 Difference]: Without dead ends: 92 [2025-04-29 11:19:19,463 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-04-29 11:19:19,464 INFO L437 NwaCegarLoop]: 76 mSDtfsCounter, 3 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:19,464 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 391 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:19:19,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-04-29 11:19:19,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-04-29 11:19:19,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 87 states have internal predecessors, (93), 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) [2025-04-29 11:19:19,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2025-04-29 11:19:19,471 INFO L79 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 26 [2025-04-29 11:19:19,472 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:19,472 INFO L485 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2025-04-29 11:19:19,472 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 11:19:19,472 INFO L278 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2025-04-29 11:19:19,472 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:19:19,472 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:19,472 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:19,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:19,673 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-29 11:19:19,673 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:19,673 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:19,673 INFO L85 PathProgramCache]: Analyzing trace with hash 104403431, now seen corresponding path program 1 times [2025-04-29 11:19:19,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:19,674 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539684128] [2025-04-29 11:19:19,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:19,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:19,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:19:19,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:19:19,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:19,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:19,963 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:19,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:19,963 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539684128] [2025-04-29 11:19:19,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539684128] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:19,963 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155067900] [2025-04-29 11:19:19,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:19,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:19,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:19,965 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) [2025-04-29 11:19:19,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:19:20,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:19:20,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:19:20,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:20,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:20,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-29 11:19:20,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:20,051 INFO L354 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 [2025-04-29 11:19:20,057 INFO L354 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 [2025-04-29 11:19:20,160 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:19:20,161 INFO L354 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 [2025-04-29 11:19:20,174 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:19:20,175 INFO L354 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 [2025-04-29 11:19:20,204 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:20,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:20,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155067900] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:20,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:20,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2025-04-29 11:19:20,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15927359] [2025-04-29 11:19:20,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:20,309 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:19:20,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:20,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:19:20,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:19:20,309 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 11:19:20,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:20,523 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2025-04-29 11:19:20,524 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:19:20,524 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2025-04-29 11:19:20,524 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:20,524 INFO L225 Difference]: With dead ends: 92 [2025-04-29 11:19:20,524 INFO L226 Difference]: Without dead ends: 92 [2025-04-29 11:19:20,525 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:19:20,525 INFO L437 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:20,525 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:19:20,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-04-29 11:19:20,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-04-29 11:19:20,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 51 states have (on average 1.803921568627451) internal successors, (92), 87 states have internal predecessors, (92), 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) [2025-04-29 11:19:20,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2025-04-29 11:19:20,533 INFO L79 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 26 [2025-04-29 11:19:20,533 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:20,533 INFO L485 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2025-04-29 11:19:20,533 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 11:19:20,534 INFO L278 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2025-04-29 11:19:20,534 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:19:20,534 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:20,534 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:20,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:19:20,735 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-04-29 11:19:20,735 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:20,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:20,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1547602984, now seen corresponding path program 1 times [2025-04-29 11:19:20,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:20,735 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593322076] [2025-04-29 11:19:20,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:20,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:20,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:19:20,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:19:20,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:20,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:20,795 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:19:20,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:20,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593322076] [2025-04-29 11:19:20,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593322076] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:20,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392428378] [2025-04-29 11:19:20,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:20,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:20,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:20,797 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) [2025-04-29 11:19:20,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:19:20,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:19:20,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:19:20,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:20,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:20,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-29 11:19:20,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:20,893 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:19:20,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:20,919 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:19:20,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392428378] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:19:20,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:19:20,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-04-29 11:19:20,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431058061] [2025-04-29 11:19:20,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:20,920 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:19:20,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:20,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:19:20,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:20,920 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:20,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:20,958 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2025-04-29 11:19:20,959 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:19:20,959 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2025-04-29 11:19:20,959 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:20,959 INFO L225 Difference]: With dead ends: 92 [2025-04-29 11:19:20,959 INFO L226 Difference]: Without dead ends: 92 [2025-04-29 11:19:20,960 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:20,960 INFO L437 NwaCegarLoop]: 81 mSDtfsCounter, 1 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:20,960 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 389 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:19:20,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-04-29 11:19:20,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-04-29 11:19:20,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 87 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) [2025-04-29 11:19:20,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2025-04-29 11:19:20,963 INFO L79 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 28 [2025-04-29 11:19:20,964 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:20,964 INFO L485 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2025-04-29 11:19:20,964 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:20,964 INFO L278 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2025-04-29 11:19:20,964 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:19:20,964 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:20,964 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:20,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:19:21,165 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:21,165 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:21,166 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:21,166 INFO L85 PathProgramCache]: Analyzing trace with hash 726253940, now seen corresponding path program 1 times [2025-04-29 11:19:21,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:21,166 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297978385] [2025-04-29 11:19:21,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:21,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:21,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:19:21,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:19:21,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:21,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:21,228 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:19:21,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:21,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297978385] [2025-04-29 11:19:21,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297978385] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:21,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137101132] [2025-04-29 11:19:21,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:21,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:21,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:21,231 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) [2025-04-29 11:19:21,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:19:21,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:19:21,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:19:21,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:21,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:21,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-29 11:19:21,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:21,319 INFO L354 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 [2025-04-29 11:19:21,362 WARN L871 $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 [2025-04-29 11:19:21,399 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:19:21,399 INFO L354 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 [2025-04-29 11:19:21,411 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2025-04-29 11:19:21,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:21,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137101132] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:21,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:21,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2025-04-29 11:19:21,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633350868] [2025-04-29 11:19:21,450 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:21,450 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:19:21,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:21,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:19:21,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2025-04-29 11:19:21,451 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-29 11:19:21,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:21,649 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2025-04-29 11:19:21,650 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:19:21,650 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2025-04-29 11:19:21,650 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:21,650 INFO L225 Difference]: With dead ends: 91 [2025-04-29 11:19:21,650 INFO L226 Difference]: Without dead ends: 91 [2025-04-29 11:19:21,651 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2025-04-29 11:19:21,651 INFO L437 NwaCegarLoop]: 73 mSDtfsCounter, 9 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:21,651 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 290 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 307 Invalid, 0 Unknown, 89 Unchecked, 0.2s Time] [2025-04-29 11:19:21,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-04-29 11:19:21,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-04-29 11:19:21,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 51 states have (on average 1.7647058823529411) internal successors, (90), 86 states have internal predecessors, (90), 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) [2025-04-29 11:19:21,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2025-04-29 11:19:21,659 INFO L79 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 29 [2025-04-29 11:19:21,660 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:21,660 INFO L485 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2025-04-29 11:19:21,660 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-29 11:19:21,660 INFO L278 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2025-04-29 11:19:21,660 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:19:21,662 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:21,662 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:21,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:19:21,862 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:21,863 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:21,863 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:21,863 INFO L85 PathProgramCache]: Analyzing trace with hash 726253941, now seen corresponding path program 1 times [2025-04-29 11:19:21,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:21,863 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278857824] [2025-04-29 11:19:21,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:21,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:21,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:19:21,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:19:21,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:21,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:21,983 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:19:21,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:21,984 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278857824] [2025-04-29 11:19:21,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278857824] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:21,984 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288002173] [2025-04-29 11:19:21,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:21,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:21,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:21,986 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) [2025-04-29 11:19:21,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 11:19:22,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:19:22,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:19:22,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:22,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:22,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-29 11:19:22,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:22,071 INFO L354 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 [2025-04-29 11:19:22,074 INFO L354 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 [2025-04-29 11:19:22,168 WARN L871 $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 [2025-04-29 11:19:22,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:22,210 INFO L354 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 [2025-04-29 11:19:22,214 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:19:22,214 INFO L354 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 [2025-04-29 11:19:22,247 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-04-29 11:19:22,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:22,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288002173] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:22,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:22,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2025-04-29 11:19:22,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870624515] [2025-04-29 11:19:22,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:22,334 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 11:19:22,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:22,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 11:19:22,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2025-04-29 11:19:22,334 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-29 11:19:22,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:22,581 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2025-04-29 11:19:22,583 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:19:22,583 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2025-04-29 11:19:22,583 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:22,585 INFO L225 Difference]: With dead ends: 108 [2025-04-29 11:19:22,585 INFO L226 Difference]: Without dead ends: 108 [2025-04-29 11:19:22,585 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=316, Unknown=1, NotChecked=36, Total=420 [2025-04-29 11:19:22,585 INFO L437 NwaCegarLoop]: 73 mSDtfsCounter, 16 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:22,585 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 539 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 347 Invalid, 0 Unknown, 111 Unchecked, 0.2s Time] [2025-04-29 11:19:22,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-04-29 11:19:22,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 101. [2025-04-29 11:19:22,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 60 states have (on average 1.7333333333333334) internal successors, (104), 95 states have internal predecessors, (104), 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) [2025-04-29 11:19:22,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2025-04-29 11:19:22,595 INFO L79 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 29 [2025-04-29 11:19:22,595 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:22,595 INFO L485 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2025-04-29 11:19:22,595 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-29 11:19:22,595 INFO L278 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2025-04-29 11:19:22,595 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:19:22,595 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:22,595 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:22,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:22,796 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-29 11:19:22,797 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:22,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:22,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1039035659, now seen corresponding path program 1 times [2025-04-29 11:19:22,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:22,797 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246933880] [2025-04-29 11:19:22,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:22,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:22,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:19:22,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:19:22,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:22,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:22,874 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:19:22,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:22,874 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246933880] [2025-04-29 11:19:22,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246933880] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:22,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:22,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:19:22,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552996208] [2025-04-29 11:19:22,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:22,875 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:19:22,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:22,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:19:22,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:19:22,876 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:23,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:23,012 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2025-04-29 11:19:23,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:19:23,013 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-04-29 11:19:23,013 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:23,013 INFO L225 Difference]: With dead ends: 100 [2025-04-29 11:19:23,013 INFO L226 Difference]: Without dead ends: 100 [2025-04-29 11:19:23,013 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:19:23,014 INFO L437 NwaCegarLoop]: 77 mSDtfsCounter, 7 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:23,014 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 263 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:23,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-04-29 11:19:23,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-04-29 11:19:23,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 94 states have internal predecessors, (103), 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) [2025-04-29 11:19:23,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2025-04-29 11:19:23,017 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 30 [2025-04-29 11:19:23,017 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:23,017 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2025-04-29 11:19:23,017 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:23,018 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2025-04-29 11:19:23,018 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:19:23,018 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:23,018 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:23,018 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:19:23,018 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:23,019 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:23,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1039035660, now seen corresponding path program 1 times [2025-04-29 11:19:23,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:23,019 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307276942] [2025-04-29 11:19:23,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:23,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:23,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:19:23,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:19:23,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:23,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:23,170 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:19:23,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:23,170 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307276942] [2025-04-29 11:19:23,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307276942] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:23,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:23,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:19:23,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097801025] [2025-04-29 11:19:23,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:23,171 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:19:23,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:23,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:19:23,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:19:23,172 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:23,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:23,294 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2025-04-29 11:19:23,294 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:19:23,294 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-04-29 11:19:23,294 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:23,295 INFO L225 Difference]: With dead ends: 99 [2025-04-29 11:19:23,295 INFO L226 Difference]: Without dead ends: 99 [2025-04-29 11:19:23,295 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:19:23,295 INFO L437 NwaCegarLoop]: 76 mSDtfsCounter, 6 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:23,296 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 293 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:23,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-04-29 11:19:23,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-04-29 11:19:23,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 60 states have (on average 1.7) internal successors, (102), 93 states have internal predecessors, (102), 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) [2025-04-29 11:19:23,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2025-04-29 11:19:23,298 INFO L79 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 30 [2025-04-29 11:19:23,298 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:23,298 INFO L485 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2025-04-29 11:19:23,298 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:23,298 INFO L278 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2025-04-29 11:19:23,299 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 11:19:23,299 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:23,299 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:23,299 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:19:23,299 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:23,299 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:23,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1752438706, now seen corresponding path program 1 times [2025-04-29 11:19:23,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:23,300 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600037840] [2025-04-29 11:19:23,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:23,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:23,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:19:23,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:19:23,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:23,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:23,567 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:19:23,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:23,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600037840] [2025-04-29 11:19:23,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600037840] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:23,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763188154] [2025-04-29 11:19:23,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:23,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:23,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:23,570 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) [2025-04-29 11:19:23,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 11:19:23,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:19:23,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:19:23,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:23,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:23,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-29 11:19:23,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:23,676 INFO L354 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 [2025-04-29 11:19:23,713 WARN L849 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret1#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse0 (select |c_#valid| .cse0))))))) is different from false [2025-04-29 11:19:23,714 WARN L871 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret1#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse0 (select |c_#valid| .cse0))))))) is different from true [2025-04-29 11:19:23,725 WARN L849 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)) is different from false [2025-04-29 11:19:23,727 WARN L871 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)) is different from true [2025-04-29 11:19:23,792 WARN L849 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| .cse1 (select |c_#valid| .cse1))) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (= (store |v_#valid_BEFORE_CALL_11| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2)) |v_#valid_BEFORE_CALL_13|))))))) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|))) (and (= .cse3 |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) is different from false [2025-04-29 11:19:23,795 WARN L871 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| .cse1 (select |c_#valid| .cse1))) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (= (store |v_#valid_BEFORE_CALL_11| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2)) |v_#valid_BEFORE_CALL_13|))))))) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|))) (and (= .cse3 |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) is different from true [2025-04-29 11:19:23,835 WARN L849 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|))) (and (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| .cse0 (select |c_#valid| .cse0))) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= (store |v_#valid_BEFORE_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1)) |v_#valid_BEFORE_CALL_13|))))))) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse2 (select |c_#valid| .cse2)))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|))) (and (= .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) is different from false [2025-04-29 11:19:23,838 WARN L871 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|))) (and (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| .cse0 (select |c_#valid| .cse0))) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= (store |v_#valid_BEFORE_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1)) |v_#valid_BEFORE_CALL_13|))))))) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse2 (select |c_#valid| .cse2)))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|))) (and (= .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) is different from true [2025-04-29 11:19:23,921 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse0 (select |c_#valid| .cse0)))))) .cse1) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) .cse1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (= (store |v_#valid_BEFORE_CALL_11| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2)) |v_#valid_BEFORE_CALL_13|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1))))))) is different from false [2025-04-29 11:19:23,925 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse0 (select |c_#valid| .cse0)))))) .cse1) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) .cse1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (= (store |v_#valid_BEFORE_CALL_11| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2)) |v_#valid_BEFORE_CALL_13|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1))))))) is different from true [2025-04-29 11:19:24,084 WARN L849 $PredicateComparison]: unable to prove that (and (let ((.cse1 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse0 (select |c_#valid| .cse0)))))) .cse1) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) .cse1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (= (store |v_#valid_BEFORE_CALL_11| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2)) |v_#valid_BEFORE_CALL_13|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) is different from false [2025-04-29 11:19:24,087 WARN L871 $PredicateComparison]: unable to prove that (and (let ((.cse1 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse0 (select |c_#valid| .cse0)))))) .cse1) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) .cse1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (= (store |v_#valid_BEFORE_CALL_11| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2)) |v_#valid_BEFORE_CALL_13|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) is different from true [2025-04-29 11:19:24,143 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) (.cse1 (exists ((v_ArrVal_897 Int)) (= (select |c_#valid| v_ArrVal_897) 1)))) (or (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|) 1)))) .cse0) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) .cse1 .cse0) (and (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) .cse1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_11| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2)) |v_#valid_BEFORE_CALL_13|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1)) (= (select |c_#valid| .cse2) 1)))))) is different from false [2025-04-29 11:19:24,146 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) (.cse1 (exists ((v_ArrVal_897 Int)) (= (select |c_#valid| v_ArrVal_897) 1)))) (or (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|) 1)))) .cse0) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) .cse1 .cse0) (and (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) .cse1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_11| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2)) |v_#valid_BEFORE_CALL_13|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1)) (= (select |c_#valid| .cse2) 1)))))) is different from true [2025-04-29 11:19:24,263 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (exists ((v_ArrVal_897 Int)) (= (select |c_#valid| v_ArrVal_897) 1))) (.cse0 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|) 1)))) .cse0) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1)) |v_#valid_BEFORE_CALL_13|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1)) (= (select |c_#valid| .cse1) 1)))) (and (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 1))) .cse2) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 1) .cse2 .cse0))) is different from false [2025-04-29 11:19:24,266 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse2 (exists ((v_ArrVal_897 Int)) (= (select |c_#valid| v_ArrVal_897) 1))) (.cse0 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|) 1)))) .cse0) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_11| .cse1 (select |v_#valid_BEFORE_CALL_13| .cse1)) |v_#valid_BEFORE_CALL_13|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1)) (= (select |c_#valid| .cse1) 1)))) (and (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 1))) .cse2) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 1) .cse2 .cse0))) is different from true [2025-04-29 11:19:24,266 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 1 not checked. [2025-04-29 11:19:24,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:24,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763188154] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:24,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:24,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 19 [2025-04-29 11:19:24,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373656196] [2025-04-29 11:19:24,373 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:24,374 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-29 11:19:24,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:24,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-29 11:19:24,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=192, Unknown=16, NotChecked=280, Total=552 [2025-04-29 11:19:24,375 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 16 states have internal predecessors, (44), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 11:19:24,442 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret1#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1))))))))) is different from false [2025-04-29 11:19:24,443 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_#t~ret1#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1))))))))) is different from true [2025-04-29 11:19:24,445 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))))) .cse0))) is different from false [2025-04-29 11:19:24,446 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))))) .cse0))) is different from true [2025-04-29 11:19:24,460 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or (= |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse0) (or (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))))) .cse0 (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|))) (and (= .cse2 |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| .cse2 (select |c_#valid| .cse2))) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse3) (= (store |v_#valid_BEFORE_CALL_11| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3)) |v_#valid_BEFORE_CALL_13|))))))) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|))) (and (= .cse4 |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| .cse4 (select |c_#valid| .cse4))) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))))) is different from false [2025-04-29 11:19:24,463 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or (= |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse0) (or (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))))) .cse0 (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|))) (and (= .cse2 |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| .cse2 (select |c_#valid| .cse2))) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse3) (= (store |v_#valid_BEFORE_CALL_11| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3)) |v_#valid_BEFORE_CALL_13|))))))) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|))) (and (= .cse4 |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| .cse4 (select |c_#valid| .cse4))) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))))) is different from true [2025-04-29 11:19:24,482 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse0) (or (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| .cse1 (select |c_#valid| .cse1))) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (= (store |v_#valid_BEFORE_CALL_11| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2)) |v_#valid_BEFORE_CALL_13|))))))) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse3) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse3 (select |c_#valid| .cse3)))))) .cse0 (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|))) (and (= .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| .cse4 (select |c_#valid| .cse4))) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))))) is different from false [2025-04-29 11:19:24,484 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse0) (or (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| .cse1 (select |c_#valid| .cse1))) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (= (store |v_#valid_BEFORE_CALL_11| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2)) |v_#valid_BEFORE_CALL_13|))))))) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse3) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse3 (select |c_#valid| .cse3)))))) .cse0 (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|))) (and (= .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| .cse4 (select |c_#valid| .cse4))) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))))) is different from true [2025-04-29 11:19:24,501 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse0) (let ((.cse2 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))))) .cse2) (and .cse0 .cse2) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse3) (= (store |v_#valid_BEFORE_CALL_11| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3)) |v_#valid_BEFORE_CALL_13|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1))))))))) is different from false [2025-04-29 11:19:24,503 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse0) (let ((.cse2 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))))) .cse2) (and .cse0 .cse2) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse3) (= (store |v_#valid_BEFORE_CALL_11| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3)) |v_#valid_BEFORE_CALL_13|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1))))))))) is different from true [2025-04-29 11:19:24,513 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (let ((.cse2 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))))) .cse2) (and .cse0 .cse2) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse3) (= (store |v_#valid_BEFORE_CALL_11| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3)) |v_#valid_BEFORE_CALL_13|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1))))))))) is different from false [2025-04-29 11:19:24,515 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (let ((.cse2 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))))) .cse2) (and .cse0 .cse2) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse3) (= (store |v_#valid_BEFORE_CALL_11| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3)) |v_#valid_BEFORE_CALL_13|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1))))))))) is different from true [2025-04-29 11:19:24,529 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (let ((.cse2 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))))) .cse2) (and .cse0 .cse2) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse3) (= (store |v_#valid_BEFORE_CALL_11| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3)) |v_#valid_BEFORE_CALL_13|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) is different from false [2025-04-29 11:19:24,531 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (let ((.cse2 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))))) .cse2) (and .cse0 .cse2) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse3) (= (store |v_#valid_BEFORE_CALL_11| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3)) |v_#valid_BEFORE_CALL_13|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) is different from true [2025-04-29 11:19:24,539 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (let ((.cse1 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) (.cse2 (exists ((v_ArrVal_897 Int)) (= (select |c_#valid| v_ArrVal_897) 1)))) (or (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|) 1)))) .cse1) (and .cse0 .cse2 .cse1) (and (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) .cse2) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_11| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3)) |v_#valid_BEFORE_CALL_13|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1)) (= (select |c_#valid| .cse3) 1)))))))) is different from false [2025-04-29 11:19:24,542 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (let ((.cse1 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) (.cse2 (exists ((v_ArrVal_897 Int)) (= (select |c_#valid| v_ArrVal_897) 1)))) (or (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|) 1)))) .cse1) (and .cse0 .cse2 .cse1) (and (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) .cse2) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_11| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3)) |v_#valid_BEFORE_CALL_13|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1)) (= (select |c_#valid| .cse3) 1)))))))) is different from true [2025-04-29 11:19:24,563 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 1))) (and .cse0 (let ((.cse3 (exists ((v_ArrVal_897 Int)) (= (select |c_#valid| v_ArrVal_897) 1))) (.cse1 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|) 1)))) .cse1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_11| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2)) |v_#valid_BEFORE_CALL_13|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1)) (= (select |c_#valid| .cse2) 1)))) (and (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 1))) .cse3) (and .cse0 .cse3 .cse1))))) is different from false [2025-04-29 11:19:24,567 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 1))) (and .cse0 (let ((.cse3 (exists ((v_ArrVal_897 Int)) (= (select |c_#valid| v_ArrVal_897) 1))) (.cse1 (exists ((|ULTIMATE.start_dll_circular_create_~new_head~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)))) (or (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|) 1)))) .cse1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_11| |v_#valid_BEFORE_CALL_13|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_11| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2)) |v_#valid_BEFORE_CALL_13|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1)) (= (select |c_#valid| .cse2) 1)))) (and (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_13| (@diff |v_#valid_BEFORE_CALL_13| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_13| |c_ULTIMATE.start_dll_circular_remove_first_~head#1.base|) 1))) .cse3) (and .cse0 .cse3 .cse1))))) is different from true [2025-04-29 11:19:24,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:24,757 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2025-04-29 11:19:24,757 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 11:19:24,757 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 16 states have internal predecessors, (44), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2025-04-29 11:19:24,757 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:24,758 INFO L225 Difference]: With dead ends: 107 [2025-04-29 11:19:24,758 INFO L226 Difference]: Without dead ends: 107 [2025-04-29 11:19:24,758 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=34, NotChecked=782, Total=1122 [2025-04-29 11:19:24,758 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 29 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1043 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:24,759 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 365 Invalid, 1514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 463 Invalid, 0 Unknown, 1043 Unchecked, 0.2s Time] [2025-04-29 11:19:24,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-04-29 11:19:24,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2025-04-29 11:19:24,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 69 states have (on average 1.6376811594202898) internal successors, (113), 99 states have internal predecessors, (113), 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) [2025-04-29 11:19:24,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 121 transitions. [2025-04-29 11:19:24,761 INFO L79 Accepts]: Start accepts. Automaton has 105 states and 121 transitions. Word has length 34 [2025-04-29 11:19:24,761 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:24,761 INFO L485 AbstractCegarLoop]: Abstraction has 105 states and 121 transitions. [2025-04-29 11:19:24,761 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 16 states have internal predecessors, (44), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 11:19:24,761 INFO L278 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2025-04-29 11:19:24,762 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 11:19:24,762 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:24,762 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:24,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-29 11:19:24,962 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:24,963 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:24,963 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:24,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1752438705, now seen corresponding path program 1 times [2025-04-29 11:19:24,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:24,963 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394114428] [2025-04-29 11:19:24,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:24,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:24,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:19:24,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:19:24,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:24,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:25,176 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:19:25,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:25,177 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394114428] [2025-04-29 11:19:25,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394114428] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:25,177 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831631661] [2025-04-29 11:19:25,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:25,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:25,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:25,179 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) [2025-04-29 11:19:25,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-29 11:19:25,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:19:25,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:19:25,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:25,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:25,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-29 11:19:25,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:25,292 INFO L354 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 [2025-04-29 11:19:25,308 INFO L354 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 [2025-04-29 11:19:25,317 WARN L871 $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 [2025-04-29 11:19:25,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:25,346 INFO L354 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 [2025-04-29 11:19:25,360 INFO L354 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 [2025-04-29 11:19:25,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:25,392 INFO L354 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 [2025-04-29 11:19:25,434 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:19:25,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:25,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831631661] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:25,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:25,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2025-04-29 11:19:25,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853436210] [2025-04-29 11:19:25,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:25,528 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:19:25,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:25,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:19:25,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=141, Unknown=1, NotChecked=24, Total=210 [2025-04-29 11:19:25,528 INFO L87 Difference]: Start difference. First operand 105 states and 121 transitions. Second operand has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 11:19:25,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:25,675 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2025-04-29 11:19:25,675 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:19:25,676 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2025-04-29 11:19:25,676 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:25,676 INFO L225 Difference]: With dead ends: 97 [2025-04-29 11:19:25,676 INFO L226 Difference]: Without dead ends: 97 [2025-04-29 11:19:25,676 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=158, Unknown=1, NotChecked=26, Total=240 [2025-04-29 11:19:25,677 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 227 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:25,677 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 151 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 221 Invalid, 0 Unknown, 69 Unchecked, 0.1s Time] [2025-04-29 11:19:25,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-04-29 11:19:25,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-04-29 11:19:25,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.4927536231884058) internal successors, (103), 91 states have internal predecessors, (103), 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) [2025-04-29 11:19:25,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2025-04-29 11:19:25,679 INFO L79 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 34 [2025-04-29 11:19:25,679 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:25,679 INFO L485 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2025-04-29 11:19:25,680 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 11:19:25,680 INFO L278 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2025-04-29 11:19:25,680 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 11:19:25,680 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:25,680 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:25,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-29 11:19:25,885 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:25,885 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:25,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:25,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1752436882, now seen corresponding path program 1 times [2025-04-29 11:19:25,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:25,890 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115035194] [2025-04-29 11:19:25,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:25,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:25,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:19:25,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:19:25,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:25,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:25,960 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:19:25,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:25,960 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115035194] [2025-04-29 11:19:25,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115035194] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:25,961 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025950365] [2025-04-29 11:19:25,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:25,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:25,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:25,963 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) [2025-04-29 11:19:25,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-29 11:19:26,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:19:26,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:19:26,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:26,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:26,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 11:19:26,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:26,110 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:19:26,111 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:19:26,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025950365] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:26,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:19:26,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2025-04-29 11:19:26,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039632098] [2025-04-29 11:19:26,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:26,111 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:19:26,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:26,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:19:26,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:26,112 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:26,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:26,123 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2025-04-29 11:19:26,123 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:19:26,123 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2025-04-29 11:19:26,124 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:26,124 INFO L225 Difference]: With dead ends: 137 [2025-04-29 11:19:26,124 INFO L226 Difference]: Without dead ends: 137 [2025-04-29 11:19:26,124 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:26,125 INFO L437 NwaCegarLoop]: 74 mSDtfsCounter, 87 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:26,125 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 156 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:19:26,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-04-29 11:19:26,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 98. [2025-04-29 11:19:26,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 92 states have internal predecessors, (103), 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) [2025-04-29 11:19:26,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2025-04-29 11:19:26,127 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 34 [2025-04-29 11:19:26,127 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:26,127 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2025-04-29 11:19:26,127 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:26,127 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2025-04-29 11:19:26,129 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-29 11:19:26,130 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:26,130 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:26,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-29 11:19:26,332 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-29 11:19:26,332 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:26,332 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:26,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1508974974, now seen corresponding path program 1 times [2025-04-29 11:19:26,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:26,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787523119] [2025-04-29 11:19:26,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:26,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:26,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:19:26,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:19:26,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:26,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:26,414 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:19:26,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:26,415 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787523119] [2025-04-29 11:19:26,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787523119] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:26,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:26,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:19:26,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045668961] [2025-04-29 11:19:26,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:26,415 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:19:26,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:26,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:19:26,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:19:26,416 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:26,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:26,543 INFO L93 Difference]: Finished difference Result 130 states and 143 transitions. [2025-04-29 11:19:26,543 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:19:26,543 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2025-04-29 11:19:26,544 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:26,544 INFO L225 Difference]: With dead ends: 130 [2025-04-29 11:19:26,544 INFO L226 Difference]: Without dead ends: 130 [2025-04-29 11:19:26,544 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:19:26,545 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 63 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:26,545 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 219 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:26,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-04-29 11:19:26,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 100. [2025-04-29 11:19:26,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.4722222222222223) internal successors, (106), 94 states have internal predecessors, (106), 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) [2025-04-29 11:19:26,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2025-04-29 11:19:26,547 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 35 [2025-04-29 11:19:26,547 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:26,547 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2025-04-29 11:19:26,547 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:26,548 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2025-04-29 11:19:26,548 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-29 11:19:26,548 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:26,548 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:26,548 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:19:26,548 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:26,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:26,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1508974975, now seen corresponding path program 1 times [2025-04-29 11:19:26,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:26,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649685810] [2025-04-29 11:19:26,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:26,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:26,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:19:26,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:19:26,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:26,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:26,799 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:19:26,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:26,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649685810] [2025-04-29 11:19:26,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649685810] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:26,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:26,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:19:26,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717939709] [2025-04-29 11:19:26,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:26,801 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:19:26,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:26,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:19:26,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:19:26,801 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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) [2025-04-29 11:19:27,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:27,037 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2025-04-29 11:19:27,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:19:27,037 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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 35 [2025-04-29 11:19:27,037 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:27,038 INFO L225 Difference]: With dead ends: 133 [2025-04-29 11:19:27,038 INFO L226 Difference]: Without dead ends: 133 [2025-04-29 11:19:27,038 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:19:27,039 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 72 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:27,039 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 373 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:19:27,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-04-29 11:19:27,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 100. [2025-04-29 11:19:27,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 94 states have internal predecessors, (104), 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) [2025-04-29 11:19:27,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2025-04-29 11:19:27,041 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 35 [2025-04-29 11:19:27,041 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:27,041 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2025-04-29 11:19:27,041 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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) [2025-04-29 11:19:27,041 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2025-04-29 11:19:27,042 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-29 11:19:27,042 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:27,042 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:27,042 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:19:27,042 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:27,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:27,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1573995553, now seen corresponding path program 1 times [2025-04-29 11:19:27,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:27,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733954511] [2025-04-29 11:19:27,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:27,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:27,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 11:19:27,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 11:19:27,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:27,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:27,071 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:19:27,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:27,071 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733954511] [2025-04-29 11:19:27,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733954511] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:27,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:27,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:19:27,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051120390] [2025-04-29 11:19:27,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:27,072 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:19:27,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:27,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:19:27,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:19:27,073 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:27,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:27,110 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2025-04-29 11:19:27,111 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:19:27,111 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2025-04-29 11:19:27,111 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:27,111 INFO L225 Difference]: With dead ends: 99 [2025-04-29 11:19:27,111 INFO L226 Difference]: Without dead ends: 99 [2025-04-29 11:19:27,112 INFO L436 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 [2025-04-29 11:19:27,112 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 28 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:27,112 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 79 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:19:27,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-04-29 11:19:27,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2025-04-29 11:19:27,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 90 states have internal predecessors, (100), 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) [2025-04-29 11:19:27,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2025-04-29 11:19:27,114 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 37 [2025-04-29 11:19:27,114 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:27,114 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2025-04-29 11:19:27,115 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:27,115 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2025-04-29 11:19:27,115 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-29 11:19:27,115 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:27,115 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:27,115 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:19:27,115 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:27,116 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:27,116 INFO L85 PathProgramCache]: Analyzing trace with hash 2125115556, now seen corresponding path program 1 times [2025-04-29 11:19:27,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:27,116 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715962934] [2025-04-29 11:19:27,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:27,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:27,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:19:27,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:19:27,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:27,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:27,182 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-29 11:19:27,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:27,182 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715962934] [2025-04-29 11:19:27,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715962934] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:27,182 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509263759] [2025-04-29 11:19:27,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:27,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:27,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:27,184 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) [2025-04-29 11:19:27,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-29 11:19:27,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:19:27,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:19:27,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:27,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:27,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:19:27,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:27,321 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:19:27,322 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:19:27,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509263759] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:27,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:19:27,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-04-29 11:19:27,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698403891] [2025-04-29 11:19:27,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:27,322 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:19:27,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:27,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:19:27,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:19:27,322 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 11:19:27,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:27,333 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2025-04-29 11:19:27,333 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:19:27,333 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2025-04-29 11:19:27,334 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:27,334 INFO L225 Difference]: With dead ends: 72 [2025-04-29 11:19:27,334 INFO L226 Difference]: Without dead ends: 72 [2025-04-29 11:19:27,334 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:19:27,334 INFO L437 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:27,334 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:19:27,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-04-29 11:19:27,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-04-29 11:19:27,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.4) internal successors, (70), 68 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:27,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2025-04-29 11:19:27,336 INFO L79 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 41 [2025-04-29 11:19:27,336 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:27,336 INFO L485 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2025-04-29 11:19:27,336 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 11:19:27,336 INFO L278 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2025-04-29 11:19:27,336 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-29 11:19:27,336 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:27,336 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:27,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:27,537 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:27,537 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:27,538 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:27,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1551453095, now seen corresponding path program 1 times [2025-04-29 11:19:27,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:27,538 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354938114] [2025-04-29 11:19:27,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:27,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:27,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 11:19:27,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:19:27,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:27,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:27,589 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:19:27,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:27,590 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354938114] [2025-04-29 11:19:27,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354938114] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:27,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:27,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:19:27,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285452549] [2025-04-29 11:19:27,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:27,590 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:19:27,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:27,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:19:27,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:19:27,591 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:27,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:27,654 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2025-04-29 11:19:27,654 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:19:27,654 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2025-04-29 11:19:27,654 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:27,655 INFO L225 Difference]: With dead ends: 71 [2025-04-29 11:19:27,655 INFO L226 Difference]: Without dead ends: 71 [2025-04-29 11:19:27,656 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:27,657 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 23 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:27,657 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 141 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:27,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-04-29 11:19:27,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-04-29 11:19:27,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.38) internal successors, (69), 67 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:27,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2025-04-29 11:19:27,659 INFO L79 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 40 [2025-04-29 11:19:27,659 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:27,659 INFO L485 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2025-04-29 11:19:27,659 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:27,659 INFO L278 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2025-04-29 11:19:27,659 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-29 11:19:27,659 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:27,659 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:27,659 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-29 11:19:27,661 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:27,662 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:27,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1551453096, now seen corresponding path program 1 times [2025-04-29 11:19:27,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:27,662 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879406580] [2025-04-29 11:19:27,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:27,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:27,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 11:19:27,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:19:27,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:27,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:27,909 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:19:27,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:27,910 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879406580] [2025-04-29 11:19:27,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879406580] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:27,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:27,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-29 11:19:27,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628206282] [2025-04-29 11:19:27,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:27,910 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:19:27,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:27,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:19:27,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:19:27,911 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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) [2025-04-29 11:19:28,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:28,119 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2025-04-29 11:19:28,119 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:19:28,120 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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 40 [2025-04-29 11:19:28,120 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:28,120 INFO L225 Difference]: With dead ends: 101 [2025-04-29 11:19:28,120 INFO L226 Difference]: Without dead ends: 101 [2025-04-29 11:19:28,120 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:19:28,121 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 56 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:28,121 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 355 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:19:28,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-04-29 11:19:28,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 76. [2025-04-29 11:19:28,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 72 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:28,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2025-04-29 11:19:28,122 INFO L79 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 40 [2025-04-29 11:19:28,123 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:28,123 INFO L485 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2025-04-29 11:19:28,123 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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) [2025-04-29 11:19:28,123 INFO L278 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2025-04-29 11:19:28,123 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-29 11:19:28,123 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:28,123 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:28,123 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-29 11:19:28,123 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:28,123 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:28,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1551439192, now seen corresponding path program 1 times [2025-04-29 11:19:28,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:28,123 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350527232] [2025-04-29 11:19:28,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:28,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:28,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 11:19:28,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:19:28,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:28,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:28,235 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:19:28,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:28,236 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350527232] [2025-04-29 11:19:28,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350527232] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:28,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:28,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:19:28,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112152139] [2025-04-29 11:19:28,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:28,237 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:19:28,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:28,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:19:28,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:19:28,237 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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) [2025-04-29 11:19:28,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:28,364 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2025-04-29 11:19:28,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:19:28,365 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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 40 [2025-04-29 11:19:28,366 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:28,366 INFO L225 Difference]: With dead ends: 114 [2025-04-29 11:19:28,366 INFO L226 Difference]: Without dead ends: 114 [2025-04-29 11:19:28,366 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:19:28,367 INFO L437 NwaCegarLoop]: 43 mSDtfsCounter, 63 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:28,369 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 418 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:28,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-04-29 11:19:28,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 88. [2025-04-29 11:19:28,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 84 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:28,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2025-04-29 11:19:28,371 INFO L79 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 40 [2025-04-29 11:19:28,372 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:28,372 INFO L485 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2025-04-29 11:19:28,372 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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) [2025-04-29 11:19:28,372 INFO L278 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2025-04-29 11:19:28,372 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-29 11:19:28,372 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:28,372 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:28,372 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-29 11:19:28,373 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:28,373 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:28,373 INFO L85 PathProgramCache]: Analyzing trace with hash 849974784, now seen corresponding path program 1 times [2025-04-29 11:19:28,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:28,373 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844691742] [2025-04-29 11:19:28,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:28,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:28,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:19:28,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:19:28,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:28,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:28,519 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:19:28,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:28,519 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844691742] [2025-04-29 11:19:28,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844691742] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:28,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:28,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:19:28,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209231419] [2025-04-29 11:19:28,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:28,520 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:19:28,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:28,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:19:28,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:19:28,521 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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) [2025-04-29 11:19:28,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:28,688 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2025-04-29 11:19:28,688 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:19:28,688 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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 41 [2025-04-29 11:19:28,688 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:28,688 INFO L225 Difference]: With dead ends: 111 [2025-04-29 11:19:28,688 INFO L226 Difference]: Without dead ends: 111 [2025-04-29 11:19:28,689 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:19:28,689 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 53 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:28,689 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 356 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:28,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-04-29 11:19:28,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 91. [2025-04-29 11:19:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 70 states have (on average 1.4) internal successors, (98), 87 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:28,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2025-04-29 11:19:28,691 INFO L79 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 41 [2025-04-29 11:19:28,691 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:28,691 INFO L485 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2025-04-29 11:19:28,691 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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) [2025-04-29 11:19:28,691 INFO L278 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2025-04-29 11:19:28,691 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-29 11:19:28,691 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:28,691 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:28,691 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-29 11:19:28,695 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:28,696 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:28,696 INFO L85 PathProgramCache]: Analyzing trace with hash 592773928, now seen corresponding path program 1 times [2025-04-29 11:19:28,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:28,696 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937532523] [2025-04-29 11:19:28,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:28,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:28,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:19:28,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:19:28,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:28,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:29,142 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:29,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:29,142 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937532523] [2025-04-29 11:19:29,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937532523] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:29,142 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603477655] [2025-04-29 11:19:29,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:29,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:29,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:29,144 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) [2025-04-29 11:19:29,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-29 11:19:29,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:19:29,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:19:29,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:29,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:29,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-04-29 11:19:29,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:29,461 INFO L354 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 [2025-04-29 11:19:29,591 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:19:29,592 INFO L354 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 [2025-04-29 11:19:29,656 INFO L354 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 [2025-04-29 11:19:29,704 INFO L354 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 [2025-04-29 11:19:29,781 INFO L354 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 [2025-04-29 11:19:29,821 INFO L354 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 33 treesize of output 24 [2025-04-29 11:19:30,007 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:30,008 INFO L354 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 60 treesize of output 20 [2025-04-29 11:19:30,076 INFO L354 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 [2025-04-29 11:19:30,080 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:30,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:30,096 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2025-04-29 11:19:30,098 INFO L354 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 22 treesize of output 14 [2025-04-29 11:19:30,109 INFO L325 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2025-04-29 11:19:30,109 INFO L354 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 19 treesize of output 18 [2025-04-29 11:19:30,352 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:30,352 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2025-04-29 11:19:30,356 INFO L354 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 122 treesize of output 110 [2025-04-29 11:19:30,363 INFO L354 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 23 treesize of output 21 [2025-04-29 11:19:30,366 INFO L354 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 24 treesize of output 20 [2025-04-29 11:19:30,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603477655] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:30,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:30,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 39 [2025-04-29 11:19:30,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515288890] [2025-04-29 11:19:30,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:30,416 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-29 11:19:30,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:30,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-29 11:19:30,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1851, Unknown=75, NotChecked=0, Total=2070 [2025-04-29 11:19:30,417 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand has 40 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 35 states have internal predecessors, (65), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 11:19:31,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:31,185 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2025-04-29 11:19:31,186 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-29 11:19:31,186 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 35 states have internal predecessors, (65), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 42 [2025-04-29 11:19:31,186 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:31,186 INFO L225 Difference]: With dead ends: 106 [2025-04-29 11:19:31,186 INFO L226 Difference]: Without dead ends: 106 [2025-04-29 11:19:31,187 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=214, Invalid=2679, Unknown=77, NotChecked=0, Total=2970 [2025-04-29 11:19:31,187 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 142 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:31,187 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 698 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1321 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-29 11:19:31,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-04-29 11:19:31,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 93. [2025-04-29 11:19:31,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 89 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:31,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2025-04-29 11:19:31,189 INFO L79 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 42 [2025-04-29 11:19:31,190 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:31,190 INFO L485 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2025-04-29 11:19:31,190 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 35 states have internal predecessors, (65), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 11:19:31,190 INFO L278 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2025-04-29 11:19:31,190 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-29 11:19:31,190 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:31,190 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:31,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-29 11:19:31,390 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-29 11:19:31,391 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:31,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:31,391 INFO L85 PathProgramCache]: Analyzing trace with hash 592773929, now seen corresponding path program 1 times [2025-04-29 11:19:31,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:31,391 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778648482] [2025-04-29 11:19:31,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:31,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:31,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:19:31,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:19:31,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:31,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:32,108 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:32,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:32,108 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778648482] [2025-04-29 11:19:32,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778648482] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:32,108 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843100002] [2025-04-29 11:19:32,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:32,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:32,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:32,110 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) [2025-04-29 11:19:32,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-29 11:19:32,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:19:32,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:19:32,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:32,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:32,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-04-29 11:19:32,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:32,284 INFO L354 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 [2025-04-29 11:19:32,286 INFO L354 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 [2025-04-29 11:19:32,503 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:19:32,503 INFO L354 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 [2025-04-29 11:19:32,507 WARN L849 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.offset| 0) (<= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_10| |c_#length|))) (and (= (store |v_#length_BEFORE_CALL_10| .cse0 (select |c_#length| .cse0)) |c_#length|) (<= 12 (select |v_#length_BEFORE_CALL_10| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base| .cse0)))) (< 11 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (<= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) is different from false [2025-04-29 11:19:32,508 WARN L871 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.offset| 0) (<= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_10| |c_#length|))) (and (= (store |v_#length_BEFORE_CALL_10| .cse0 (select |c_#length| .cse0)) |c_#length|) (<= 12 (select |v_#length_BEFORE_CALL_10| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base| .cse0)))) (< 11 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (<= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) is different from true [2025-04-29 11:19:32,562 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:19:32,569 INFO L354 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 [2025-04-29 11:19:32,631 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 11:19:32,631 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2025-04-29 11:19:32,636 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2025-04-29 11:19:32,730 INFO L325 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-04-29 11:19:32,730 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2025-04-29 11:19:32,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:32,742 INFO L354 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 [2025-04-29 11:19:32,777 INFO L354 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 [2025-04-29 11:19:32,781 INFO L354 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 33 treesize of output 24 [2025-04-29 11:19:32,992 INFO L354 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 [2025-04-29 11:19:32,995 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:32,995 INFO L354 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 60 treesize of output 20 [2025-04-29 11:19:33,090 INFO L354 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 [2025-04-29 11:19:33,097 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:33,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:33,303 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 42 [2025-04-29 11:19:33,305 INFO L354 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 53 treesize of output 33 [2025-04-29 11:19:33,588 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:33,589 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2025-04-29 11:19:33,591 INFO L354 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 68 treesize of output 60 [2025-04-29 11:19:33,593 INFO L354 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 56 treesize of output 52 [2025-04-29 11:19:33,596 INFO L354 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 26 treesize of output 24 [2025-04-29 11:19:33,612 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:33,613 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2025-04-29 11:19:33,618 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:33,618 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2025-04-29 11:19:33,620 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:19:33,620 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:19:33,622 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 30 treesize of output 22 [2025-04-29 11:19:33,623 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:19:33,624 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:19:33,625 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 12 [2025-04-29 11:19:33,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843100002] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:33,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:33,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 39 [2025-04-29 11:19:33,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420569130] [2025-04-29 11:19:33,806 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:33,806 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-29 11:19:33,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:33,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-29 11:19:33,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2492, Unknown=3, NotChecked=100, Total=2756 [2025-04-29 11:19:33,808 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand has 40 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 35 states have internal predecessors, (65), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 11:19:34,042 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.offset| 0) (<= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 12 .cse0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (or (exists ((|v_#length_BEFORE_CALL_10| (Array Int Int))) (let ((.cse1 (@diff |v_#length_BEFORE_CALL_10| |c_#length|))) (and (= (store |v_#length_BEFORE_CALL_10| .cse1 (select |c_#length| .cse1)) |c_#length|) (<= 12 (select |v_#length_BEFORE_CALL_10| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base| .cse1)))) (< 11 .cse0)) (<= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2025-04-29 11:19:34,043 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.offset| 0) (<= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 12 .cse0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (or (exists ((|v_#length_BEFORE_CALL_10| (Array Int Int))) (let ((.cse1 (@diff |v_#length_BEFORE_CALL_10| |c_#length|))) (and (= (store |v_#length_BEFORE_CALL_10| .cse1 (select |c_#length| .cse1)) |c_#length|) (<= 12 (select |v_#length_BEFORE_CALL_10| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base| .cse1)))) (< 11 .cse0)) (<= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from true [2025-04-29 11:19:34,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:34,868 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2025-04-29 11:19:34,868 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-29 11:19:34,868 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 35 states have internal predecessors, (65), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 42 [2025-04-29 11:19:34,868 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:34,869 INFO L225 Difference]: With dead ends: 109 [2025-04-29 11:19:34,869 INFO L226 Difference]: Without dead ends: 109 [2025-04-29 11:19:34,870 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=302, Invalid=4123, Unknown=5, NotChecked=262, Total=4692 [2025-04-29 11:19:34,870 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 140 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:34,870 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 790 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1352 Invalid, 0 Unknown, 135 Unchecked, 0.5s Time] [2025-04-29 11:19:34,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-04-29 11:19:34,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 93. [2025-04-29 11:19:34,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 89 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2025-04-29 11:19:34,872 INFO L79 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 42 [2025-04-29 11:19:34,872 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:34,873 INFO L485 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2025-04-29 11:19:34,873 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 35 states have internal predecessors, (65), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 11:19:34,873 INFO L278 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2025-04-29 11:19:34,873 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-29 11:19:34,873 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:34,874 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:34,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-29 11:19:35,078 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-04-29 11:19:35,078 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:35,078 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:35,078 INFO L85 PathProgramCache]: Analyzing trace with hash 579414618, now seen corresponding path program 1 times [2025-04-29 11:19:35,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:35,078 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355786978] [2025-04-29 11:19:35,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:35,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:35,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:19:35,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:19:35,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:35,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:35,134 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:19:35,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:35,135 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355786978] [2025-04-29 11:19:35,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355786978] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:35,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:35,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:19:35,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975642450] [2025-04-29 11:19:35,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:35,135 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:19:35,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:35,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:19:35,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:19:35,136 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:35,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:35,198 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2025-04-29 11:19:35,198 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:19:35,198 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2025-04-29 11:19:35,198 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:35,199 INFO L225 Difference]: With dead ends: 92 [2025-04-29 11:19:35,199 INFO L226 Difference]: Without dead ends: 92 [2025-04-29 11:19:35,199 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:35,199 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 23 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:35,200 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 137 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:35,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-04-29 11:19:35,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-04-29 11:19:35,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 88 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:35,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2025-04-29 11:19:35,202 INFO L79 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 42 [2025-04-29 11:19:35,202 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:35,203 INFO L485 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2025-04-29 11:19:35,203 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:35,203 INFO L278 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2025-04-29 11:19:35,203 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-29 11:19:35,203 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:35,203 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:35,203 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-29 11:19:35,204 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:35,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:35,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1196122630, now seen corresponding path program 1 times [2025-04-29 11:19:35,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:35,204 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368043417] [2025-04-29 11:19:35,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:35,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:35,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:19:35,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:19:35,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:35,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:35,453 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:19:35,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:35,454 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368043417] [2025-04-29 11:19:35,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368043417] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:35,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:35,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-29 11:19:35,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082777361] [2025-04-29 11:19:35,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:35,454 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 11:19:35,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:35,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 11:19:35,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:19:35,455 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 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) [2025-04-29 11:19:35,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:35,643 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2025-04-29 11:19:35,643 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:19:35,643 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 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 43 [2025-04-29 11:19:35,643 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:35,643 INFO L225 Difference]: With dead ends: 95 [2025-04-29 11:19:35,643 INFO L226 Difference]: Without dead ends: 95 [2025-04-29 11:19:35,644 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-04-29 11:19:35,644 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 22 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:35,644 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 410 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:35,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-04-29 11:19:35,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2025-04-29 11:19:35,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.36986301369863) internal successors, (100), 89 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:35,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2025-04-29 11:19:35,646 INFO L79 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 43 [2025-04-29 11:19:35,646 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:35,646 INFO L485 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2025-04-29 11:19:35,646 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 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) [2025-04-29 11:19:35,646 INFO L278 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2025-04-29 11:19:35,647 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-29 11:19:35,647 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:35,647 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:35,647 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-29 11:19:35,647 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:35,647 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:35,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1196122631, now seen corresponding path program 1 times [2025-04-29 11:19:35,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:35,647 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214626473] [2025-04-29 11:19:35,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:35,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:35,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:19:35,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:19:35,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:35,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:36,177 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:19:36,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:36,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214626473] [2025-04-29 11:19:36,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214626473] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:36,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545479781] [2025-04-29 11:19:36,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:36,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:36,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:36,180 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) [2025-04-29 11:19:36,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-29 11:19:36,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:19:36,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:19:36,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:36,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:36,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-04-29 11:19:36,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:36,437 INFO L354 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 [2025-04-29 11:19:36,441 INFO L354 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 [2025-04-29 11:19:36,655 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:19:36,655 INFO L354 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 [2025-04-29 11:19:36,663 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:19:36,663 INFO L354 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 [2025-04-29 11:19:36,765 INFO L354 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 [2025-04-29 11:19:36,768 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:19:36,917 INFO L354 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 48 treesize of output 28 [2025-04-29 11:19:36,951 INFO L354 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 [2025-04-29 11:19:36,953 INFO L354 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 [2025-04-29 11:19:36,993 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:36,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:37,151 INFO L354 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 62 treesize of output 46 [2025-04-29 11:19:37,153 INFO L354 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 50 treesize of output 34 [2025-04-29 11:19:37,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545479781] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:37,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:37,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 34 [2025-04-29 11:19:37,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050852854] [2025-04-29 11:19:37,344 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:37,344 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-29 11:19:37,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:37,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-29 11:19:37,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1764, Unknown=0, NotChecked=0, Total=1892 [2025-04-29 11:19:37,345 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand has 35 states, 33 states have (on average 2.121212121212121) internal successors, (70), 30 states have internal predecessors, (70), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 11:19:38,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:38,048 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2025-04-29 11:19:38,048 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 11:19:38,049 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 2.121212121212121) internal successors, (70), 30 states have internal predecessors, (70), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 43 [2025-04-29 11:19:38,049 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:38,049 INFO L225 Difference]: With dead ends: 105 [2025-04-29 11:19:38,049 INFO L226 Difference]: Without dead ends: 105 [2025-04-29 11:19:38,050 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=262, Invalid=3044, Unknown=0, NotChecked=0, Total=3306 [2025-04-29 11:19:38,050 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 124 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:38,050 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 756 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 11:19:38,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-04-29 11:19:38,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2025-04-29 11:19:38,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.356164383561644) internal successors, (99), 89 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:38,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2025-04-29 11:19:38,052 INFO L79 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 43 [2025-04-29 11:19:38,052 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:38,052 INFO L485 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2025-04-29 11:19:38,052 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 2.121212121212121) internal successors, (70), 30 states have internal predecessors, (70), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 11:19:38,052 INFO L278 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2025-04-29 11:19:38,057 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-29 11:19:38,057 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:38,057 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:38,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:38,257 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-29 11:19:38,257 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:38,258 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:38,258 INFO L85 PathProgramCache]: Analyzing trace with hash 781984067, now seen corresponding path program 1 times [2025-04-29 11:19:38,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:38,258 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940368115] [2025-04-29 11:19:38,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:38,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:38,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:19:38,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:19:38,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:38,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:38,442 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:19:38,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:38,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940368115] [2025-04-29 11:19:38,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940368115] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:38,443 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426701410] [2025-04-29 11:19:38,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:38,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:38,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:38,445 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) [2025-04-29 11:19:38,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-29 11:19:38,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:19:38,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:19:38,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:38,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:38,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:19:38,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:38,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:38,686 INFO L354 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 [2025-04-29 11:19:38,687 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:19:38,687 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:19:38,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426701410] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:38,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:19:38,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 16 [2025-04-29 11:19:38,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223130218] [2025-04-29 11:19:38,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:38,688 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:19:38,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:38,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:19:38,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:19:38,689 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:38,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:38,792 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2025-04-29 11:19:38,792 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:19:38,792 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2025-04-29 11:19:38,793 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:38,793 INFO L225 Difference]: With dead ends: 92 [2025-04-29 11:19:38,793 INFO L226 Difference]: Without dead ends: 92 [2025-04-29 11:19:38,793 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:19:38,794 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 63 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:38,794 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 123 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:38,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-04-29 11:19:38,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-04-29 11:19:38,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 88 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:38,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2025-04-29 11:19:38,796 INFO L79 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 43 [2025-04-29 11:19:38,796 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:38,796 INFO L485 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2025-04-29 11:19:38,796 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:38,796 INFO L278 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2025-04-29 11:19:38,796 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-29 11:19:38,796 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:38,796 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:38,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:39,001 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-29 11:19:39,001 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:39,001 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:39,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1577386328, now seen corresponding path program 1 times [2025-04-29 11:19:39,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:39,001 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654539370] [2025-04-29 11:19:39,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:39,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:39,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:19:39,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:19:39,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:39,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:39,121 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:19:39,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:39,121 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654539370] [2025-04-29 11:19:39,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654539370] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:39,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:39,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:19:39,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890643832] [2025-04-29 11:19:39,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:39,122 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:19:39,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:39,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:19:39,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:19:39,123 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 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) [2025-04-29 11:19:39,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:39,230 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2025-04-29 11:19:39,230 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:19:39,230 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 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 45 [2025-04-29 11:19:39,230 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:39,231 INFO L225 Difference]: With dead ends: 115 [2025-04-29 11:19:39,231 INFO L226 Difference]: Without dead ends: 115 [2025-04-29 11:19:39,231 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:19:39,231 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 53 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:39,232 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 407 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:39,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-04-29 11:19:39,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2025-04-29 11:19:39,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.3625) internal successors, (109), 95 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:39,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2025-04-29 11:19:39,234 INFO L79 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 45 [2025-04-29 11:19:39,234 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:39,234 INFO L485 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2025-04-29 11:19:39,234 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 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) [2025-04-29 11:19:39,234 INFO L278 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2025-04-29 11:19:39,234 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-29 11:19:39,234 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:39,234 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:39,234 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-29 11:19:39,235 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:39,235 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:39,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1654335797, now seen corresponding path program 1 times [2025-04-29 11:19:39,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:39,235 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883830669] [2025-04-29 11:19:39,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:39,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:39,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:19:39,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:19:39,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:39,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:39,373 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:19:39,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:39,374 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883830669] [2025-04-29 11:19:39,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883830669] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:39,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:39,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:19:39,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272367004] [2025-04-29 11:19:39,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:39,375 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:19:39,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:39,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:19:39,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:19:39,376 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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) [2025-04-29 11:19:39,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:39,508 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2025-04-29 11:19:39,508 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:19:39,508 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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 46 [2025-04-29 11:19:39,508 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:39,509 INFO L225 Difference]: With dead ends: 108 [2025-04-29 11:19:39,509 INFO L226 Difference]: Without dead ends: 108 [2025-04-29 11:19:39,509 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:19:39,509 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 33 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:39,509 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 346 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:39,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-04-29 11:19:39,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2025-04-29 11:19:39,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 98 states have internal predecessors, (112), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:39,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2025-04-29 11:19:39,511 INFO L79 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 46 [2025-04-29 11:19:39,511 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:39,511 INFO L485 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2025-04-29 11:19:39,511 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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) [2025-04-29 11:19:39,511 INFO L278 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2025-04-29 11:19:39,511 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-29 11:19:39,512 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:39,512 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:39,512 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-29 11:19:39,512 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:39,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:39,512 INFO L85 PathProgramCache]: Analyzing trace with hash 184787293, now seen corresponding path program 1 times [2025-04-29 11:19:39,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:39,512 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480413179] [2025-04-29 11:19:39,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:39,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:39,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:19:39,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:19:39,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:39,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:39,563 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:19:39,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:39,563 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480413179] [2025-04-29 11:19:39,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480413179] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:39,563 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165201078] [2025-04-29 11:19:39,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:39,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:39,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:39,565 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) [2025-04-29 11:19:39,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-29 11:19:39,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:19:39,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:19:39,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:39,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:39,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-29 11:19:39,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:39,748 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:19:39,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:39,756 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:19:39,756 INFO L354 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 12 treesize of output 11 [2025-04-29 11:19:39,770 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:19:39,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165201078] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:19:39,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:19:39,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-04-29 11:19:39,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579050150] [2025-04-29 11:19:39,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:39,771 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:19:39,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:39,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:19:39,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:19:39,772 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:39,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:39,823 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2025-04-29 11:19:39,823 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:19:39,824 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2025-04-29 11:19:39,824 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:39,824 INFO L225 Difference]: With dead ends: 100 [2025-04-29 11:19:39,824 INFO L226 Difference]: Without dead ends: 100 [2025-04-29 11:19:39,824 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:39,824 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 82 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:39,824 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 99 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:19:39,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-04-29 11:19:39,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-04-29 11:19:39,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 96 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:39,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2025-04-29 11:19:39,829 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 46 [2025-04-29 11:19:39,829 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:39,829 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2025-04-29 11:19:39,831 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:39,831 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2025-04-29 11:19:39,831 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-29 11:19:39,831 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:39,832 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:39,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:40,032 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:40,032 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:40,033 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:40,033 INFO L85 PathProgramCache]: Analyzing trace with hash 255197962, now seen corresponding path program 1 times [2025-04-29 11:19:40,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:40,033 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142536335] [2025-04-29 11:19:40,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:40,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:40,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-29 11:19:40,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 11:19:40,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:40,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:40,080 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:19:40,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:40,080 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142536335] [2025-04-29 11:19:40,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142536335] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:40,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:40,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:19:40,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371381111] [2025-04-29 11:19:40,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:40,081 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:19:40,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:40,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:19:40,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:19:40,082 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:40,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:40,138 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2025-04-29 11:19:40,138 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:19:40,139 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2025-04-29 11:19:40,139 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:40,139 INFO L225 Difference]: With dead ends: 99 [2025-04-29 11:19:40,139 INFO L226 Difference]: Without dead ends: 99 [2025-04-29 11:19:40,139 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:40,139 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 17 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:40,140 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 133 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:19:40,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-04-29 11:19:40,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-04-29 11:19:40,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 95 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:40,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2025-04-29 11:19:40,141 INFO L79 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 47 [2025-04-29 11:19:40,141 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:40,141 INFO L485 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2025-04-29 11:19:40,141 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:40,142 INFO L278 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2025-04-29 11:19:40,142 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-29 11:19:40,142 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:40,142 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:40,142 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-29 11:19:40,142 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:40,142 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:40,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1433438799, now seen corresponding path program 1 times [2025-04-29 11:19:40,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:40,142 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528754587] [2025-04-29 11:19:40,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:40,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:40,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-29 11:19:40,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 11:19:40,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:40,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:41,160 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:41,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:41,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528754587] [2025-04-29 11:19:41,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528754587] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:41,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483553001] [2025-04-29 11:19:41,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:41,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:41,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:41,163 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) [2025-04-29 11:19:41,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-29 11:19:41,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-29 11:19:41,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 11:19:41,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:41,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:41,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-04-29 11:19:41,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:41,359 INFO L354 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 [2025-04-29 11:19:41,514 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:19:41,514 INFO L354 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 [2025-04-29 11:19:41,572 INFO L354 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 [2025-04-29 11:19:41,626 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 11:19:41,626 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2025-04-29 11:19:41,695 INFO L325 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-04-29 11:19:41,695 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2025-04-29 11:19:41,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:41,703 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-04-29 11:19:42,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:42,057 INFO L325 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2025-04-29 11:19:42,057 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 55 treesize of output 41 [2025-04-29 11:19:42,242 INFO L354 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 [2025-04-29 11:19:42,268 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:42,268 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:42,436 INFO L354 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 [2025-04-29 11:19:42,490 INFO L354 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 [2025-04-29 11:19:42,574 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3044 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3044) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) is different from false [2025-04-29 11:19:42,750 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:42,750 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-04-29 11:19:42,752 INFO L354 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 171 treesize of output 165 [2025-04-29 11:19:42,756 INFO L354 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 87 treesize of output 85 [2025-04-29 11:19:42,765 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:42,765 INFO L354 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 92 treesize of output 96 [2025-04-29 11:19:42,769 INFO L354 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 96 treesize of output 92 [2025-04-29 11:19:43,273 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-04-29 11:19:43,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483553001] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:19:43,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:19:43,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 25, 25] total 77 [2025-04-29 11:19:43,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682856714] [2025-04-29 11:19:43,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:43,274 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2025-04-29 11:19:43,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:43,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2025-04-29 11:19:43,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=5393, Unknown=42, NotChecked=148, Total=5852 [2025-04-29 11:19:43,276 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 77 states, 76 states have (on average 1.5921052631578947) internal successors, (121), 69 states have internal predecessors, (121), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 11:19:44,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:44,881 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2025-04-29 11:19:44,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-29 11:19:44,881 INFO L79 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 1.5921052631578947) internal successors, (121), 69 states have internal predecessors, (121), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2025-04-29 11:19:44,881 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:44,882 INFO L225 Difference]: With dead ends: 81 [2025-04-29 11:19:44,882 INFO L226 Difference]: Without dead ends: 79 [2025-04-29 11:19:44,883 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2416 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=549, Invalid=8917, Unknown=44, NotChecked=192, Total=9702 [2025-04-29 11:19:44,883 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 161 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 2070 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 2163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:44,884 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 930 Invalid, 2163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2070 Invalid, 0 Unknown, 79 Unchecked, 0.9s Time] [2025-04-29 11:19:44,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-04-29 11:19:44,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2025-04-29 11:19:44,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 73 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:44,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2025-04-29 11:19:44,885 INFO L79 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 47 [2025-04-29 11:19:44,885 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:44,885 INFO L485 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2025-04-29 11:19:44,885 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 1.5921052631578947) internal successors, (121), 69 states have internal predecessors, (121), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 11:19:44,885 INFO L278 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2025-04-29 11:19:44,886 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-29 11:19:44,886 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:44,886 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:44,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:45,086 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:45,086 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:45,086 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:45,086 INFO L85 PathProgramCache]: Analyzing trace with hash -678797650, now seen corresponding path program 1 times [2025-04-29 11:19:45,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:45,087 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211828117] [2025-04-29 11:19:45,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:45,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:45,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:19:45,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:19:45,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:45,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:45,248 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:19:45,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:45,248 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211828117] [2025-04-29 11:19:45,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211828117] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:45,248 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035805080] [2025-04-29 11:19:45,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:45,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:45,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:45,250 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) [2025-04-29 11:19:45,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-29 11:19:45,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:19:45,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:19:45,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:45,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:45,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:19:45,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:45,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:45,488 INFO L354 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 [2025-04-29 11:19:45,489 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:19:45,489 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:19:45,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035805080] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:45,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:19:45,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 16 [2025-04-29 11:19:45,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761390897] [2025-04-29 11:19:45,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:45,490 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:19:45,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:45,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:19:45,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:19:45,490 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:45,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:45,594 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2025-04-29 11:19:45,595 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:19:45,595 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2025-04-29 11:19:45,595 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:45,595 INFO L225 Difference]: With dead ends: 76 [2025-04-29 11:19:45,595 INFO L226 Difference]: Without dead ends: 76 [2025-04-29 11:19:45,596 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:19:45,596 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 71 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:45,596 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 111 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:45,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-04-29 11:19:45,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-04-29 11:19:45,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 72 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:45,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2025-04-29 11:19:45,598 INFO L79 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 48 [2025-04-29 11:19:45,598 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:45,598 INFO L485 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2025-04-29 11:19:45,598 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:45,598 INFO L278 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2025-04-29 11:19:45,598 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-29 11:19:45,598 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:45,598 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:45,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-29 11:19:45,803 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-04-29 11:19:45,803 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:45,803 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:45,803 INFO L85 PathProgramCache]: Analyzing trace with hash -492570021, now seen corresponding path program 1 times [2025-04-29 11:19:45,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:45,803 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631132621] [2025-04-29 11:19:45,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:45,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:45,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:19:45,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:19:45,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:45,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:46,454 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:46,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:46,454 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631132621] [2025-04-29 11:19:46,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631132621] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:46,454 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789594983] [2025-04-29 11:19:46,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:46,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:46,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:46,456 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) [2025-04-29 11:19:46,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-29 11:19:46,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:19:46,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:19:46,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:46,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:46,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-04-29 11:19:46,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:46,654 INFO L354 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 [2025-04-29 11:19:46,709 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:19:46,709 INFO L354 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 [2025-04-29 11:19:46,759 INFO L354 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 [2025-04-29 11:19:46,796 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 11:19:46,796 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2025-04-29 11:19:46,857 INFO L325 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-04-29 11:19:46,857 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2025-04-29 11:19:46,889 INFO L354 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 33 treesize of output 24 [2025-04-29 11:19:47,250 INFO L325 Elim1Store]: treesize reduction 48, result has 51.5 percent of original size [2025-04-29 11:19:47,251 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 73 [2025-04-29 11:19:47,502 INFO L354 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 79 treesize of output 63 [2025-04-29 11:19:47,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:47,625 INFO L354 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 9 [2025-04-29 11:19:47,659 INFO L354 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 28 treesize of output 8 [2025-04-29 11:19:47,664 INFO L354 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 [2025-04-29 11:19:47,665 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:47,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:47,922 INFO L354 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 [2025-04-29 11:19:48,019 INFO L354 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 29 treesize of output 17 [2025-04-29 11:19:48,164 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:48,165 INFO L354 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 60 treesize of output 64 [2025-04-29 11:19:48,297 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_3380 (Array Int Int)) (v_ArrVal_3381 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3380) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3381) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (forall ((v_ArrVal_3380 (Array Int Int)) (v_ArrVal_3381 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3380) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3381) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from false [2025-04-29 11:19:48,305 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:48,305 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-04-29 11:19:48,307 INFO L354 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 85 treesize of output 81 [2025-04-29 11:19:48,309 INFO L354 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 100 treesize of output 96 [2025-04-29 11:19:48,313 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:48,313 INFO L354 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 94 treesize of output 98 [2025-04-29 11:19:48,316 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 83 [2025-04-29 11:19:48,337 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:48,337 INFO L354 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 26 treesize of output 27 [2025-04-29 11:19:48,339 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:19:48,340 INFO L354 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 40 treesize of output 36 [2025-04-29 11:19:48,345 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:48,345 INFO L354 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 30 treesize of output 34 [2025-04-29 11:19:48,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:48,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789594983] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:48,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:48,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30] total 48 [2025-04-29 11:19:48,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135134494] [2025-04-29 11:19:48,488 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:48,488 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-04-29 11:19:48,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:48,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-04-29 11:19:48,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=3915, Unknown=1, NotChecked=126, Total=4290 [2025-04-29 11:19:48,490 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand has 49 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 45 states have internal predecessors, (80), 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) [2025-04-29 11:19:49,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:49,434 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2025-04-29 11:19:49,434 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-29 11:19:49,434 INFO L79 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 45 states have internal predecessors, (80), 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) Word has length 53 [2025-04-29 11:19:49,434 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:49,435 INFO L225 Difference]: With dead ends: 110 [2025-04-29 11:19:49,435 INFO L226 Difference]: Without dead ends: 110 [2025-04-29 11:19:49,436 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1425 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=381, Invalid=5474, Unknown=1, NotChecked=150, Total=6006 [2025-04-29 11:19:49,436 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 86 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:49,436 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 660 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-29 11:19:49,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-04-29 11:19:49,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 83. [2025-04-29 11:19:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 79 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2025-04-29 11:19:49,438 INFO L79 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 53 [2025-04-29 11:19:49,438 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:49,438 INFO L485 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2025-04-29 11:19:49,438 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 45 states have internal predecessors, (80), 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) [2025-04-29 11:19:49,438 INFO L278 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2025-04-29 11:19:49,438 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-29 11:19:49,438 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:49,438 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:49,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-29 11:19:49,639 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:49,639 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:19:49,639 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:49,640 INFO L85 PathProgramCache]: Analyzing trace with hash -492570020, now seen corresponding path program 1 times [2025-04-29 11:19:49,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:49,640 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539417949] [2025-04-29 11:19:49,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:49,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:49,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:19:49,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:19:49,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:49,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:50,607 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:19:50,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:50,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539417949] [2025-04-29 11:19:50,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539417949] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:50,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886360142] [2025-04-29 11:19:50,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:50,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:50,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:50,609 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) [2025-04-29 11:19:50,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-29 11:19:50,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:19:50,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:19:50,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:50,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:50,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 124 conjuncts are in the unsatisfiable core [2025-04-29 11:19:50,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:50,836 INFO L354 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 [2025-04-29 11:19:50,838 INFO L354 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 [2025-04-29 11:19:51,107 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:19:51,107 INFO L354 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 [2025-04-29 11:19:51,117 INFO L354 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 [2025-04-29 11:19:51,202 INFO L354 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 [2025-04-29 11:19:51,205 INFO L354 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 [2025-04-29 11:19:51,270 INFO L354 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 [2025-04-29 11:19:51,274 INFO L354 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 [2025-04-29 11:19:51,374 INFO L354 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 [2025-04-29 11:19:51,379 INFO L354 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 [2025-04-29 11:19:51,389 INFO L354 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 [2025-04-29 11:19:51,392 INFO L354 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 33 treesize of output 24 [2025-04-29 11:19:51,682 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:51,682 INFO L354 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 27 treesize of output 31 [2025-04-29 11:19:51,970 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:51,970 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 121 [2025-04-29 11:19:53,067 INFO L325 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2025-04-29 11:19:53,067 INFO L354 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 120 treesize of output 84 [2025-04-29 11:19:53,078 INFO L325 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-04-29 11:19:53,078 INFO L354 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 30 treesize of output 14 [2025-04-29 11:19:53,436 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:53,437 INFO L354 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 93 treesize of output 65 [2025-04-29 11:19:53,530 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:53,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:59,055 INFO L354 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 85 treesize of output 75 [2025-04-29 11:19:59,077 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:59,077 INFO L354 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 101 treesize of output 113 [2025-04-29 11:19:59,084 INFO L354 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 93 treesize of output 81 [2025-04-29 11:19:59,114 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:59,115 INFO L354 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 124 treesize of output 136 [2025-04-29 11:20:00,083 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:20:00,083 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2025-04-29 11:20:00,085 INFO L354 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 68 treesize of output 60 [2025-04-29 11:20:00,088 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2025-04-29 11:20:00,096 INFO L354 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 22 treesize of output 20 [2025-04-29 11:20:00,117 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:20:00,117 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2025-04-29 11:20:00,122 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:20:00,123 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2025-04-29 11:20:00,125 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:20:00,125 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:20:00,127 INFO L354 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 30 treesize of output 22 [2025-04-29 11:20:00,129 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:20:00,129 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:20:00,131 INFO L354 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 20 treesize of output 12 [2025-04-29 11:20:00,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886360142] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:20:00,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:20:00,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 59 [2025-04-29 11:20:00,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118446866] [2025-04-29 11:20:00,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:20:00,735 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-04-29 11:20:00,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:00,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-04-29 11:20:00,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=5713, Unknown=2, NotChecked=0, Total=6006 [2025-04-29 11:20:00,736 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 60 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 54 states have internal predecessors, (97), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 11:20:05,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:05,430 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2025-04-29 11:20:05,430 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-29 11:20:05,430 INFO L79 Accepts]: Start accepts. Automaton has has 60 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 54 states have internal predecessors, (97), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 53 [2025-04-29 11:20:05,431 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:05,431 INFO L225 Difference]: With dead ends: 111 [2025-04-29 11:20:05,431 INFO L226 Difference]: Without dead ends: 111 [2025-04-29 11:20:05,432 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2020 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=701, Invalid=9599, Unknown=2, NotChecked=0, Total=10302 [2025-04-29 11:20:05,433 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 321 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 1719 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 1739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-29 11:20:05,433 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 654 Invalid, 1739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1719 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-29 11:20:05,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-04-29 11:20:05,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 83. [2025-04-29 11:20:05,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 79 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:20:05,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2025-04-29 11:20:05,434 INFO L79 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 53 [2025-04-29 11:20:05,434 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:05,434 INFO L485 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2025-04-29 11:20:05,434 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 54 states have internal predecessors, (97), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 11:20:05,434 INFO L278 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2025-04-29 11:20:05,435 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-29 11:20:05,435 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:05,435 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:20:05,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-29 11:20:05,635 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:05,635 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:20:05,636 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:05,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1911953366, now seen corresponding path program 1 times [2025-04-29 11:20:05,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:05,636 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065758179] [2025-04-29 11:20:05,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:05,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:05,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-29 11:20:05,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-29 11:20:05,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:05,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:05,709 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:20:05,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:05,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065758179] [2025-04-29 11:20:05,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065758179] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:20:05,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562226224] [2025-04-29 11:20:05,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:05,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:05,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:20:05,712 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) [2025-04-29 11:20:05,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-29 11:20:05,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-29 11:20:05,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-29 11:20:05,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:05,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:05,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:20:05,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:20:06,064 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:20:06,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:20:06,133 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:20:06,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562226224] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:20:06,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:20:06,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-04-29 11:20:06,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238824039] [2025-04-29 11:20:06,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:20:06,133 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:20:06,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:06,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:20:06,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:20:06,134 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:20:06,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:06,163 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2025-04-29 11:20:06,163 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:20:06,163 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2025-04-29 11:20:06,164 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:06,164 INFO L225 Difference]: With dead ends: 112 [2025-04-29 11:20:06,164 INFO L226 Difference]: Without dead ends: 112 [2025-04-29 11:20:06,164 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:20:06,164 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 101 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:20:06,164 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 212 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:20:06,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-04-29 11:20:06,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 83. [2025-04-29 11:20:06,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 79 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:20:06,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2025-04-29 11:20:06,166 INFO L79 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 54 [2025-04-29 11:20:06,166 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:06,166 INFO L485 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2025-04-29 11:20:06,166 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:20:06,166 INFO L278 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2025-04-29 11:20:06,166 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-04-29 11:20:06,166 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:06,166 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:20:06,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-29 11:20:06,370 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:06,371 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:20:06,371 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:06,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2098432789, now seen corresponding path program 1 times [2025-04-29 11:20:06,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:06,371 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917404022] [2025-04-29 11:20:06,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:06,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:06,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-29 11:20:06,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:20:06,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:06,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:06,589 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:20:06,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:06,589 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917404022] [2025-04-29 11:20:06,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917404022] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:20:06,589 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519639404] [2025-04-29 11:20:06,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:06,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:06,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:20:06,591 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:20:06,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-29 11:20:06,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-29 11:20:06,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:20:06,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:06,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:06,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 116 conjuncts are in the unsatisfiable core [2025-04-29 11:20:06,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:20:06,802 INFO L354 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 [2025-04-29 11:20:06,811 INFO L354 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 [2025-04-29 11:20:07,076 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:20:07,077 INFO L354 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 [2025-04-29 11:20:07,084 INFO L354 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 [2025-04-29 11:20:07,186 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:20:07,190 INFO L354 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 [2025-04-29 11:20:07,260 INFO L354 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 [2025-04-29 11:20:07,266 INFO L354 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 [2025-04-29 11:20:07,360 INFO L354 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 [2025-04-29 11:20:07,365 INFO L354 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 [2025-04-29 11:20:07,373 INFO L354 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 33 treesize of output 24 [2025-04-29 11:20:07,382 INFO L354 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 [2025-04-29 11:20:07,637 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:20:07,643 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:20:07,643 INFO L354 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 27 treesize of output 19 [2025-04-29 11:20:07,964 INFO L325 Elim1Store]: treesize reduction 48, result has 51.5 percent of original size [2025-04-29 11:20:07,964 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 73 [2025-04-29 11:20:08,713 INFO L354 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 23 treesize of output 3 [2025-04-29 11:20:08,719 INFO L354 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 28 treesize of output 8 [2025-04-29 11:20:08,967 INFO L354 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 [2025-04-29 11:20:09,016 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:20:09,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:20:09,918 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:20:09,919 INFO L354 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 111 treesize of output 110 [2025-04-29 11:20:10,083 INFO L354 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 27 [2025-04-29 11:20:12,035 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3926 (Array Int Int)) (v_ArrVal_3929 Int) (v_ArrVal_3925 (Array Int Int))) (let ((.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse0 (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3925) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_3929) 0))) (or (< (+ .cse0 7) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3926) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (< .cse0 0))))) is different from false [2025-04-29 11:20:12,061 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3926 (Array Int Int)) (v_ArrVal_3929 Int) (v_ArrVal_3925 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3925) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 v_ArrVal_3929) 0))) (or (< .cse0 0) (< (+ 7 .cse0) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3926) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))))))) is different from false [2025-04-29 11:20:12,077 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3926 (Array Int Int)) (v_ArrVal_3929 Int) (v_ArrVal_3923 (Array Int Int)) (v_ArrVal_3924 (Array Int Int)) (v_ArrVal_3925 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3924) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3925) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 v_ArrVal_3929) 0))) (or (< .cse0 0) (< (+ 7 .cse0) (select |c_#length| (select (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3923) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3926) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))))))) is different from false [2025-04-29 11:20:12,100 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:20:12,100 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 72 [2025-04-29 11:20:12,105 INFO L354 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 259 treesize of output 253 [2025-04-29 11:20:12,116 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:20:12,117 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 154 [2025-04-29 11:20:12,130 INFO L354 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 502 treesize of output 492 [2025-04-29 11:20:12,153 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:20:12,154 INFO L354 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 87 treesize of output 91 [2025-04-29 11:20:12,165 INFO L354 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 174 treesize of output 170 [2025-04-29 11:20:12,187 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:20:12,188 INFO L354 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 161 treesize of output 163 [2025-04-29 11:20:12,201 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 91 [2025-04-29 11:20:12,210 INFO L354 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 312 treesize of output 304 [2025-04-29 11:20:12,222 INFO L354 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 158 treesize of output 154 [2025-04-29 11:20:12,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519639404] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:20:12,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:20:12,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 30] total 37 [2025-04-29 11:20:12,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707702070] [2025-04-29 11:20:12,932 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:20:12,933 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-29 11:20:12,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:12,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-29 11:20:12,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2892, Unknown=4, NotChecked=330, Total=3422 [2025-04-29 11:20:12,933 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand has 38 states, 37 states have (on average 2.675675675675676) internal successors, (99), 35 states have internal predecessors, (99), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 11:20:15,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:15,508 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2025-04-29 11:20:15,508 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-29 11:20:15,508 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.675675675675676) internal successors, (99), 35 states have internal predecessors, (99), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2025-04-29 11:20:15,508 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:15,509 INFO L225 Difference]: With dead ends: 142 [2025-04-29 11:20:15,509 INFO L226 Difference]: Without dead ends: 142 [2025-04-29 11:20:15,509 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=465, Invalid=5395, Unknown=4, NotChecked=456, Total=6320 [2025-04-29 11:20:15,510 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 194 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 1688 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 1692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:20:15,510 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 885 Invalid, 1692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1688 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-29 11:20:15,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-04-29 11:20:15,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 92. [2025-04-29 11:20:15,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 88 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:20:15,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2025-04-29 11:20:15,511 INFO L79 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 58 [2025-04-29 11:20:15,511 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:15,511 INFO L485 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2025-04-29 11:20:15,512 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.675675675675676) internal successors, (99), 35 states have internal predecessors, (99), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-04-29 11:20:15,512 INFO L278 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2025-04-29 11:20:15,512 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-04-29 11:20:15,512 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:15,512 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:20:15,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-29 11:20:15,713 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-29 11:20:15,713 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2025-04-29 11:20:15,713 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:15,713 INFO L85 PathProgramCache]: Analyzing trace with hash -2098446693, now seen corresponding path program 1 times [2025-04-29 11:20:15,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:15,714 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135795585] [2025-04-29 11:20:15,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:15,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:15,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-29 11:20:15,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:20:15,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:15,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:16,682 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:20:16,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:16,682 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135795585] [2025-04-29 11:20:16,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135795585] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:20:16,682 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074997643] [2025-04-29 11:20:16,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:16,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:16,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:20:16,684 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:20:16,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-29 11:20:16,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-29 11:20:16,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:20:16,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:16,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:16,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 84 conjuncts are in the unsatisfiable core [2025-04-29 11:20:16,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:20:16,911 INFO L354 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 [2025-04-29 11:20:17,131 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:20:17,131 INFO L354 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 [2025-04-29 11:20:17,228 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:20:17,289 INFO L354 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 [2025-04-29 11:20:17,402 INFO L354 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 [2025-04-29 11:20:17,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:20:17,452 INFO L354 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 11 [2025-04-29 11:20:17,704 INFO L325 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2025-04-29 11:20:17,704 INFO L354 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 27 treesize of output 19 [2025-04-29 11:20:18,061 INFO L354 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 23 treesize of output 3 [2025-04-29 11:20:18,224 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:20:18,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:20:18,957 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:20:18,958 INFO L354 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 36 treesize of output 39 [2025-04-29 11:20:19,021 INFO L354 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 20 treesize of output 12 [2025-04-29 11:20:19,223 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4109 (Array Int Int)) (v_ArrVal_4110 Int)) (< (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4109) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_4110) 0) 1)) is different from false [2025-04-29 11:20:19,236 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4109 (Array Int Int)) (v_ArrVal_4110 Int) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_47| Int)) (or (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_47| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4109) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_47| 4) v_ArrVal_4110) 0) 1))) is different from false [2025-04-29 11:20:19,246 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4108 (Array Int Int)) (v_ArrVal_4109 (Array Int Int)) (v_ArrVal_4110 Int) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_47| Int)) (or (< (select (store (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4108) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4109) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_47| 4) v_ArrVal_4110) 0) 1) (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_47| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2025-04-29 11:20:19,261 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:20:19,261 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-04-29 11:20:19,265 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 76 [2025-04-29 11:20:19,271 INFO L354 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 46 treesize of output 44 [2025-04-29 11:20:19,277 INFO L354 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 104 treesize of output 100 [2025-04-29 11:20:19,304 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:20:19,305 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 68 [2025-04-29 11:20:19,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074997643] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:20:19,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:20:19,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 49 [2025-04-29 11:20:19,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442391251] [2025-04-29 11:20:19,691 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:20:19,692 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-04-29 11:20:19,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:19,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-04-29 11:20:19,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=3355, Unknown=3, NotChecked=354, Total=3906 [2025-04-29 11:20:19,694 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 50 states, 49 states have (on average 1.9183673469387754) internal successors, (94), 45 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Killed by 15