./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/list-ext_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/list-ext_1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 e978ccdde62c7126e7c77a584896efdc6e7afe04b6752d127d7236cecdea192f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:13:43,533 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:13:43,571 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:13:43,574 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:13:43,574 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:13:43,597 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:13:43,598 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:13:43,598 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:13:43,599 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:13:43,599 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:13:43,600 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:13:43,600 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:13:43,600 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:13:43,600 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:13:43,600 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:13:43,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:13:43,601 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:13:43,601 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:13:43,601 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:13:43,601 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:13:43,601 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:13:43,601 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:13:43,601 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:13:43,601 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:13:43,601 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:13:43,601 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:13:43,601 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:13:43,601 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:13:43,601 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:13:43,602 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:13:43,602 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:13:43,602 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:13:43,602 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:13:43,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:13:43,602 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:13:43,602 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:13:43,602 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:13:43,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:13:43,602 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:13:43,602 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:13:43,602 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:13:43,602 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:13:43,602 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-jdk21/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 -> e978ccdde62c7126e7c77a584896efdc6e7afe04b6752d127d7236cecdea192f [2025-02-06 10:13:43,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:13:43,972 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:13:43,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:13:43,977 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:13:43,977 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:13:43,978 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/list-ext_1.i [2025-02-06 10:13:45,144 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43d70b4eb/a22612b7627c4b668473c140d01a9ae0/FLAGd1a437e70 [2025-02-06 10:13:45,409 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:13:45,409 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext_1.i [2025-02-06 10:13:45,419 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43d70b4eb/a22612b7627c4b668473c140d01a9ae0/FLAGd1a437e70 [2025-02-06 10:13:45,430 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43d70b4eb/a22612b7627c4b668473c140d01a9ae0 [2025-02-06 10:13:45,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:13:45,433 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:13:45,435 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:13:45,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:13:45,438 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:13:45,439 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:13:45" (1/1) ... [2025-02-06 10:13:45,440 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45fc36cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:45, skipping insertion in model container [2025-02-06 10:13:45,440 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:13:45" (1/1) ... [2025-02-06 10:13:45,467 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:13:45,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:13:45,658 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:13:45,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:13:45,717 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:13:45,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:45 WrapperNode [2025-02-06 10:13:45,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:13:45,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:13:45,719 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:13:45,719 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:13:45,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:45" (1/1) ... [2025-02-06 10:13:45,734 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:45" (1/1) ... [2025-02-06 10:13:45,752 INFO L138 Inliner]: procedures = 124, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 126 [2025-02-06 10:13:45,754 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:13:45,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:13:45,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:13:45,755 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:13:45,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:45" (1/1) ... [2025-02-06 10:13:45,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:45" (1/1) ... [2025-02-06 10:13:45,762 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:45" (1/1) ... [2025-02-06 10:13:45,776 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2025-02-06 10:13:45,776 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:45" (1/1) ... [2025-02-06 10:13:45,776 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:45" (1/1) ... [2025-02-06 10:13:45,781 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:45" (1/1) ... [2025-02-06 10:13:45,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:45" (1/1) ... [2025-02-06 10:13:45,782 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:45" (1/1) ... [2025-02-06 10:13:45,783 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:45" (1/1) ... [2025-02-06 10:13:45,785 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:13:45,787 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:13:45,787 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:13:45,787 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:13:45,788 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:45" (1/1) ... [2025-02-06 10:13:45,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:13:45,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:13:45,817 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:13:45,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:13:45,838 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-02-06 10:13:45,838 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-02-06 10:13:45,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:13:45,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:13:45,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:13:45,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:13:45,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:13:45,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:13:45,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:13:45,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:13:45,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:13:45,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:13:45,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:13:45,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:13:45,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:13:45,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:13:45,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:13:45,919 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:13:45,921 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:13:45,936 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-02-06 10:13:46,184 INFO L? ?]: Removed 85 outVars from TransFormulas that were not future-live. [2025-02-06 10:13:46,184 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:13:46,196 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:13:46,197 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:13:46,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:13:46 BoogieIcfgContainer [2025-02-06 10:13:46,197 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:13:46,199 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:13:46,199 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:13:46,203 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:13:46,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:13:45" (1/3) ... [2025-02-06 10:13:46,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@597342bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:13:46, skipping insertion in model container [2025-02-06 10:13:46,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:45" (2/3) ... [2025-02-06 10:13:46,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@597342bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:13:46, skipping insertion in model container [2025-02-06 10:13:46,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:13:46" (3/3) ... [2025-02-06 10:13:46,206 INFO L128 eAbstractionObserver]: Analyzing ICFG list-ext_1.i [2025-02-06 10:13:46,217 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:13:46,219 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG list-ext_1.i that has 2 procedures, 100 locations, 1 initial locations, 5 loop locations, and 38 error locations. [2025-02-06 10:13:46,250 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:13:46,258 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d3ea93d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:13:46,258 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-02-06 10:13:46,261 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 57 states have (on average 1.9649122807017543) internal successors, (112), 97 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:46,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:13:46,266 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:46,266 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:46,267 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-02-06 10:13:46,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:46,270 INFO L85 PathProgramCache]: Analyzing trace with hash -533133502, now seen corresponding path program 1 times [2025-02-06 10:13:46,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:46,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531771218] [2025-02-06 10:13:46,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:46,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:46,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:13:46,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:13:46,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:46,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:46,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:46,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:46,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531771218] [2025-02-06 10:13:46,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531771218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:46,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:46,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:13:46,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44523722] [2025-02-06 10:13:46,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:46,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 10:13:46,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:46,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 10:13:46,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 10:13:46,392 INFO L87 Difference]: Start difference. First operand has 99 states, 57 states have (on average 1.9649122807017543) internal successors, (112), 97 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:46,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:46,407 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2025-02-06 10:13:46,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 10:13:46,409 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 10:13:46,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:46,413 INFO L225 Difference]: With dead ends: 98 [2025-02-06 10:13:46,413 INFO L226 Difference]: Without dead ends: 91 [2025-02-06 10:13:46,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 10:13:46,418 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:46,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:13:46,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-06 10:13:46,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-06 10:13:46,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 53 states have (on average 1.830188679245283) internal successors, (97), 90 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:46,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2025-02-06 10:13:46,452 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 7 [2025-02-06 10:13:46,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:46,452 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2025-02-06 10:13:46,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:46,452 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2025-02-06 10:13:46,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:13:46,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:46,452 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:46,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:13:46,453 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-02-06 10:13:46,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:46,453 INFO L85 PathProgramCache]: Analyzing trace with hash 652720470, now seen corresponding path program 1 times [2025-02-06 10:13:46,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:46,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244945152] [2025-02-06 10:13:46,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:46,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:46,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:13:46,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:13:46,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:46,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:46,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:46,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:46,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244945152] [2025-02-06 10:13:46,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244945152] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:46,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:46,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:13:46,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313272608] [2025-02-06 10:13:46,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:46,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:13:46,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:46,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:13:46,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:13:46,576 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:46,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:46,728 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2025-02-06 10:13:46,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:13:46,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 10:13:46,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:46,729 INFO L225 Difference]: With dead ends: 95 [2025-02-06 10:13:46,730 INFO L226 Difference]: Without dead ends: 95 [2025-02-06 10:13:46,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-02-06 10:13:46,730 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 116 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:46,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 65 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:13:46,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-06 10:13:46,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-02-06 10:13:46,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.6323529411764706) internal successors, (111), 94 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:46,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2025-02-06 10:13:46,736 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 8 [2025-02-06 10:13:46,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:46,736 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2025-02-06 10:13:46,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:46,736 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2025-02-06 10:13:46,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:13:46,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:46,737 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:46,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:13:46,737 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-02-06 10:13:46,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:46,737 INFO L85 PathProgramCache]: Analyzing trace with hash 652720471, now seen corresponding path program 1 times [2025-02-06 10:13:46,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:46,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54721375] [2025-02-06 10:13:46,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:46,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:46,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:13:46,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:13:46,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:46,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:46,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:46,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:46,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54721375] [2025-02-06 10:13:46,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54721375] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:46,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:46,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:13:46,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545016007] [2025-02-06 10:13:46,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:46,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:13:46,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:46,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:13:46,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:13:46,889 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:47,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:47,024 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2025-02-06 10:13:47,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:13:47,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 10:13:47,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:47,025 INFO L225 Difference]: With dead ends: 116 [2025-02-06 10:13:47,025 INFO L226 Difference]: Without dead ends: 116 [2025-02-06 10:13:47,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-02-06 10:13:47,026 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 119 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:47,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 92 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:13:47,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-06 10:13:47,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-02-06 10:13:47,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 115 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:47,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 130 transitions. [2025-02-06 10:13:47,034 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 130 transitions. Word has length 8 [2025-02-06 10:13:47,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:47,034 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 130 transitions. [2025-02-06 10:13:47,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:47,035 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 130 transitions. [2025-02-06 10:13:47,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 10:13:47,035 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:47,035 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:47,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:13:47,035 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-02-06 10:13:47,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:47,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1670386377, now seen corresponding path program 1 times [2025-02-06 10:13:47,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:47,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351347642] [2025-02-06 10:13:47,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:47,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:47,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 10:13:47,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 10:13:47,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:47,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:47,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:47,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:47,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351347642] [2025-02-06 10:13:47,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351347642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:47,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:47,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:13:47,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938830777] [2025-02-06 10:13:47,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:47,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:13:47,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:47,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:13:47,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:13:47,229 INFO L87 Difference]: Start difference. First operand 116 states and 130 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:47,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:47,400 INFO L93 Difference]: Finished difference Result 120 states and 138 transitions. [2025-02-06 10:13:47,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:13:47,400 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-06 10:13:47,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:47,402 INFO L225 Difference]: With dead ends: 120 [2025-02-06 10:13:47,402 INFO L226 Difference]: Without dead ends: 120 [2025-02-06 10:13:47,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:13:47,403 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 30 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:47,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 219 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:13:47,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-06 10:13:47,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-02-06 10:13:47,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 94 states have (on average 1.4680851063829787) internal successors, (138), 119 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:47,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 138 transitions. [2025-02-06 10:13:47,410 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 138 transitions. Word has length 17 [2025-02-06 10:13:47,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:47,410 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 138 transitions. [2025-02-06 10:13:47,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:47,410 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 138 transitions. [2025-02-06 10:13:47,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 10:13:47,410 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:47,410 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:47,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:13:47,412 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-02-06 10:13:47,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:47,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1670386378, now seen corresponding path program 1 times [2025-02-06 10:13:47,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:47,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120404855] [2025-02-06 10:13:47,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:47,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:47,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 10:13:47,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 10:13:47,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:47,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:47,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:47,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:47,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120404855] [2025-02-06 10:13:47,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120404855] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:47,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:47,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:13:47,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456874095] [2025-02-06 10:13:47,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:47,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:13:47,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:47,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:13:47,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:13:47,661 INFO L87 Difference]: Start difference. First operand 120 states and 138 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:47,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:47,850 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2025-02-06 10:13:47,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:13:47,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-06 10:13:47,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:47,851 INFO L225 Difference]: With dead ends: 122 [2025-02-06 10:13:47,851 INFO L226 Difference]: Without dead ends: 122 [2025-02-06 10:13:47,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:13:47,852 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 16 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:47,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 260 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:13:47,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-06 10:13:47,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 104. [2025-02-06 10:13:47,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 103 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:47,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2025-02-06 10:13:47,856 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 17 [2025-02-06 10:13:47,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:47,856 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2025-02-06 10:13:47,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:47,856 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2025-02-06 10:13:47,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 10:13:47,856 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:47,856 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:47,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:13:47,857 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-02-06 10:13:47,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:47,857 INFO L85 PathProgramCache]: Analyzing trace with hash -181068898, now seen corresponding path program 1 times [2025-02-06 10:13:47,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:47,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100844443] [2025-02-06 10:13:47,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:47,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:47,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 10:13:47,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 10:13:47,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:47,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:47,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:47,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:47,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100844443] [2025-02-06 10:13:47,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100844443] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:47,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:47,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:13:47,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26795354] [2025-02-06 10:13:47,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:47,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:13:47,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:47,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:13:47,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:13:47,986 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:48,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:48,134 INFO L93 Difference]: Finished difference Result 154 states and 173 transitions. [2025-02-06 10:13:48,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:13:48,134 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-06 10:13:48,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:48,135 INFO L225 Difference]: With dead ends: 154 [2025-02-06 10:13:48,135 INFO L226 Difference]: Without dead ends: 154 [2025-02-06 10:13:48,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:13:48,136 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 72 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:48,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 245 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:13:48,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-02-06 10:13:48,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 116. [2025-02-06 10:13:48,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 115 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:48,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 132 transitions. [2025-02-06 10:13:48,146 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 132 transitions. Word has length 20 [2025-02-06 10:13:48,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:48,146 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 132 transitions. [2025-02-06 10:13:48,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:48,146 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 132 transitions. [2025-02-06 10:13:48,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 10:13:48,149 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:48,149 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:48,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:13:48,150 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-02-06 10:13:48,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:48,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1864449069, now seen corresponding path program 1 times [2025-02-06 10:13:48,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:48,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246132571] [2025-02-06 10:13:48,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:48,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:48,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 10:13:48,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 10:13:48,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:48,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:48,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:48,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:48,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246132571] [2025-02-06 10:13:48,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246132571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:48,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:48,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:13:48,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921558882] [2025-02-06 10:13:48,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:48,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:13:48,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:48,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:13:48,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:13:48,258 INFO L87 Difference]: Start difference. First operand 116 states and 132 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:48,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:48,404 INFO L93 Difference]: Finished difference Result 114 states and 130 transitions. [2025-02-06 10:13:48,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:13:48,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-06 10:13:48,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:48,405 INFO L225 Difference]: With dead ends: 114 [2025-02-06 10:13:48,405 INFO L226 Difference]: Without dead ends: 114 [2025-02-06 10:13:48,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:13:48,406 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 24 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:48,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 191 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:13:48,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-06 10:13:48,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-02-06 10:13:48,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 113 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:48,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2025-02-06 10:13:48,413 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 20 [2025-02-06 10:13:48,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:48,414 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2025-02-06 10:13:48,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:48,414 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2025-02-06 10:13:48,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 10:13:48,415 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:48,415 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:48,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:13:48,416 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-02-06 10:13:48,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:48,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1864449070, now seen corresponding path program 1 times [2025-02-06 10:13:48,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:48,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401070421] [2025-02-06 10:13:48,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:48,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:48,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 10:13:48,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 10:13:48,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:48,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:48,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:48,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:48,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401070421] [2025-02-06 10:13:48,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401070421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:48,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:48,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:13:48,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035394819] [2025-02-06 10:13:48,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:48,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:13:48,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:48,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:13:48,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:13:48,590 INFO L87 Difference]: Start difference. First operand 114 states and 130 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:48,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:48,750 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2025-02-06 10:13:48,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:13:48,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-06 10:13:48,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:48,751 INFO L225 Difference]: With dead ends: 109 [2025-02-06 10:13:48,751 INFO L226 Difference]: Without dead ends: 109 [2025-02-06 10:13:48,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:13:48,752 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 7 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:48,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 231 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:13:48,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-06 10:13:48,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2025-02-06 10:13:48,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 98 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:48,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2025-02-06 10:13:48,754 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 20 [2025-02-06 10:13:48,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:48,755 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2025-02-06 10:13:48,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:48,755 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2025-02-06 10:13:48,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 10:13:48,755 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:48,755 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:48,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:13:48,755 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-02-06 10:13:48,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:48,756 INFO L85 PathProgramCache]: Analyzing trace with hash -14399791, now seen corresponding path program 1 times [2025-02-06 10:13:48,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:48,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348982599] [2025-02-06 10:13:48,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:48,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:48,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 10:13:48,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 10:13:48,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:48,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:48,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:48,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:48,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348982599] [2025-02-06 10:13:48,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348982599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:48,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:48,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:13:48,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507542184] [2025-02-06 10:13:48,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:48,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:13:48,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:48,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:13:48,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:13:48,867 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:48,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:48,990 INFO L93 Difference]: Finished difference Result 140 states and 159 transitions. [2025-02-06 10:13:48,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:13:48,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-06 10:13:48,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:48,991 INFO L225 Difference]: With dead ends: 140 [2025-02-06 10:13:48,991 INFO L226 Difference]: Without dead ends: 140 [2025-02-06 10:13:48,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:13:48,991 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 77 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:48,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 257 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:13:48,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-06 10:13:48,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 102. [2025-02-06 10:13:48,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 101 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:48,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2025-02-06 10:13:48,995 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 23 [2025-02-06 10:13:48,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:48,995 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2025-02-06 10:13:48,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:48,995 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2025-02-06 10:13:48,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:13:48,996 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:48,996 INFO L218 NwaCegarLoop]: trace histogram [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-02-06 10:13:48,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:13:48,996 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-02-06 10:13:48,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:48,997 INFO L85 PathProgramCache]: Analyzing trace with hash -478882511, now seen corresponding path program 1 times [2025-02-06 10:13:48,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:48,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606305549] [2025-02-06 10:13:48,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:48,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:49,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:13:49,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:13:49,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:49,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:49,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:49,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:49,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606305549] [2025-02-06 10:13:49,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606305549] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:49,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:49,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:13:49,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446950473] [2025-02-06 10:13:49,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:49,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:13:49,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:49,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:13:49,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:13:49,154 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:49,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:49,301 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2025-02-06 10:13:49,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:13:49,301 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-06 10:13:49,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:49,302 INFO L225 Difference]: With dead ends: 115 [2025-02-06 10:13:49,302 INFO L226 Difference]: Without dead ends: 115 [2025-02-06 10:13:49,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:13:49,303 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 28 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:49,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 251 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:13:49,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-02-06 10:13:49,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 104. [2025-02-06 10:13:49,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 103 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:49,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2025-02-06 10:13:49,309 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 24 [2025-02-06 10:13:49,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:49,309 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2025-02-06 10:13:49,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:49,309 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2025-02-06 10:13:49,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 10:13:49,310 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:49,310 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 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-02-06 10:13:49,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 10:13:49,310 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-02-06 10:13:49,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:49,310 INFO L85 PathProgramCache]: Analyzing trace with hash -2093445970, now seen corresponding path program 1 times [2025-02-06 10:13:49,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:49,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834538322] [2025-02-06 10:13:49,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:49,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:49,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 10:13:49,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:13:49,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:49,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:49,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:49,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:49,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834538322] [2025-02-06 10:13:49,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834538322] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:49,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:49,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:13:49,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852010397] [2025-02-06 10:13:49,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:49,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:13:49,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:49,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:13:49,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:13:49,352 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:49,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:49,412 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2025-02-06 10:13:49,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:13:49,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-02-06 10:13:49,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:49,413 INFO L225 Difference]: With dead ends: 116 [2025-02-06 10:13:49,413 INFO L226 Difference]: Without dead ends: 116 [2025-02-06 10:13:49,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-02-06 10:13:49,414 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 84 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:49,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 94 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:13:49,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-06 10:13:49,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 106. [2025-02-06 10:13:49,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 105 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:49,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2025-02-06 10:13:49,419 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 27 [2025-02-06 10:13:49,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:49,419 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2025-02-06 10:13:49,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:49,419 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2025-02-06 10:13:49,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 10:13:49,419 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:49,419 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 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-02-06 10:13:49,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 10:13:49,420 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-02-06 10:13:49,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:49,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1756883381, now seen corresponding path program 1 times [2025-02-06 10:13:49,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:49,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714782322] [2025-02-06 10:13:49,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:49,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:49,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:13:49,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:13:49,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:49,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:49,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:49,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:49,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714782322] [2025-02-06 10:13:49,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714782322] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:49,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:49,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:13:49,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194487835] [2025-02-06 10:13:49,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:49,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:13:49,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:49,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:13:49,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:13:49,503 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:49,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:49,588 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2025-02-06 10:13:49,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:13:49,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-06 10:13:49,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:49,589 INFO L225 Difference]: With dead ends: 141 [2025-02-06 10:13:49,589 INFO L226 Difference]: Without dead ends: 137 [2025-02-06 10:13:49,589 INFO L434 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-02-06 10:13:49,590 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 47 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:49,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 190 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:13:49,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-06 10:13:49,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 110. [2025-02-06 10:13:49,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 109 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:49,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2025-02-06 10:13:49,592 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 29 [2025-02-06 10:13:49,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:49,592 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2025-02-06 10:13:49,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:49,592 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2025-02-06 10:13:49,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 10:13:49,593 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:49,593 INFO L218 NwaCegarLoop]: trace histogram [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-02-06 10:13:49,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 10:13:49,593 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-02-06 10:13:49,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:49,594 INFO L85 PathProgramCache]: Analyzing trace with hash -641458573, now seen corresponding path program 1 times [2025-02-06 10:13:49,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:49,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610005888] [2025-02-06 10:13:49,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:49,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:49,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:13:49,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:13:49,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:49,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:49,830 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:49,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:49,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610005888] [2025-02-06 10:13:49,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610005888] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:13:49,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572339230] [2025-02-06 10:13:49,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:49,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:13:49,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:13:49,833 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:13:49,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 10:13:49,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:13:49,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:13:49,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:49,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:49,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 10:13:49,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:13:50,002 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 10:13:50,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 10:13:50,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 10:13:50,201 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-06 10:13:50,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2025-02-06 10:13:50,222 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:13:50,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 10:13:50,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 10:13:50,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:50,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:13:50,456 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_201 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) 1)) is different from false [2025-02-06 10:13:50,478 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_201 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) 1)) is different from false [2025-02-06 10:13:50,486 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_201 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_201) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) 1)) is different from false [2025-02-06 10:13:50,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:13:50,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-02-06 10:13:50,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:13:50,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2025-02-06 10:13:50,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2025-02-06 10:13:51,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:13:51,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 150 treesize of output 748 [2025-02-06 10:14:15,072 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-02-06 10:14:15,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572339230] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:14:15,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:14:15,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2025-02-06 10:14:15,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006446094] [2025-02-06 10:14:15,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:14:15,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-06 10:14:15,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:15,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-06 10:14:15,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=560, Unknown=3, NotChecked=150, Total=812 [2025-02-06 10:14:15,073 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 29 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:15,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:15,835 INFO L93 Difference]: Finished difference Result 189 states and 214 transitions. [2025-02-06 10:14:15,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 10:14:15,835 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 29 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-06 10:14:15,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:15,836 INFO L225 Difference]: With dead ends: 189 [2025-02-06 10:14:15,836 INFO L226 Difference]: Without dead ends: 189 [2025-02-06 10:14:15,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=237, Invalid=1178, Unknown=3, NotChecked=222, Total=1640 [2025-02-06 10:14:15,837 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 216 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 506 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:15,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 853 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 984 Invalid, 0 Unknown, 506 Unchecked, 0.5s Time] [2025-02-06 10:14:15,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-02-06 10:14:15,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 125. [2025-02-06 10:14:15,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 109 states have (on average 1.2935779816513762) internal successors, (141), 124 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:15,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2025-02-06 10:14:15,841 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 29 [2025-02-06 10:14:15,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:15,841 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2025-02-06 10:14:15,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 29 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:15,842 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2025-02-06 10:14:15,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 10:14:15,843 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:15,843 INFO L218 NwaCegarLoop]: trace histogram [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-02-06 10:14:15,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 10:14:16,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-06 10:14:16,048 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-02-06 10:14:16,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:16,048 INFO L85 PathProgramCache]: Analyzing trace with hash 670818449, now seen corresponding path program 1 times [2025-02-06 10:14:16,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:16,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070776096] [2025-02-06 10:14:16,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:16,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:16,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:14:16,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:14:16,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:16,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:16,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:16,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:16,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070776096] [2025-02-06 10:14:16,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070776096] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:14:16,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028031296] [2025-02-06 10:14:16,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:16,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:14:16,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:14:16,364 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:14:16,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 10:14:16,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:14:16,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:14:16,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:16,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:16,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 10:14:16,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:14:16,487 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:14:16,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:14:16,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 10:14:16,564 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-06 10:14:16,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 [2025-02-06 10:14:16,586 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:14:16,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 10:14:16,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 10:14:16,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:16,637 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:14:16,672 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) 1)) is different from false [2025-02-06 10:14:16,680 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-02-06 10:14:16,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2025-02-06 10:14:16,683 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) is different from false [2025-02-06 10:14:16,707 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_#t~mem8#1.base|)) is different from false [2025-02-06 10:14:16,711 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_261) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse0))) is different from false [2025-02-06 10:14:16,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:14:16,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-02-06 10:14:16,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:14:16,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2025-02-06 10:14:16,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-06 10:14:16,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:14:16,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2025-02-06 10:14:16,818 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-02-06 10:14:16,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028031296] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:14:16,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:14:16,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 29 [2025-02-06 10:14:16,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187027484] [2025-02-06 10:14:16,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:14:16,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-06 10:14:16,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:16,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-06 10:14:16,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=563, Unknown=4, NotChecked=204, Total=870 [2025-02-06 10:14:16,820 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:17,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:17,335 INFO L93 Difference]: Finished difference Result 206 states and 237 transitions. [2025-02-06 10:14:17,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 10:14:17,335 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-06 10:14:17,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:17,336 INFO L225 Difference]: With dead ends: 206 [2025-02-06 10:14:17,336 INFO L226 Difference]: Without dead ends: 206 [2025-02-06 10:14:17,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=205, Invalid=1067, Unknown=4, NotChecked=284, Total=1560 [2025-02-06 10:14:17,337 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 348 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 786 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:17,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 815 Invalid, 1660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 821 Invalid, 0 Unknown, 786 Unchecked, 0.4s Time] [2025-02-06 10:14:17,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-02-06 10:14:17,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 147. [2025-02-06 10:14:17,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 131 states have (on average 1.2900763358778626) internal successors, (169), 146 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:17,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 169 transitions. [2025-02-06 10:14:17,344 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 169 transitions. Word has length 29 [2025-02-06 10:14:17,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:17,344 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 169 transitions. [2025-02-06 10:14:17,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:17,344 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions. [2025-02-06 10:14:17,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 10:14:17,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:17,344 INFO L218 NwaCegarLoop]: trace histogram [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-02-06 10:14:17,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 10:14:17,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:14:17,545 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-02-06 10:14:17,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:17,545 INFO L85 PathProgramCache]: Analyzing trace with hash 670818450, now seen corresponding path program 1 times [2025-02-06 10:14:17,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:17,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661883594] [2025-02-06 10:14:17,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:17,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:17,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:14:17,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:14:17,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:17,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:17,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:17,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:17,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661883594] [2025-02-06 10:14:17,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661883594] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:14:17,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644623731] [2025-02-06 10:14:17,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:17,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:14:17,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:14:17,919 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:14:17,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 10:14:17,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:14:17,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:14:17,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:17,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:17,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-06 10:14:17,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:14:18,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 10:14:18,026 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:14:18,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:14:18,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:14:18,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 10:14:18,162 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:14:18,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2025-02-06 10:14:18,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-06 10:14:18,176 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-06 10:14:18,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2025-02-06 10:14:18,203 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:14:18,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-06 10:14:18,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-06 10:14:18,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 10:14:18,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 10:14:18,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:18,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:14:18,374 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_326 (Array Int Int)) (v_ArrVal_325 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (forall ((v_ArrVal_325 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2025-02-06 10:14:18,412 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_326 (Array Int Int)) (v_ArrVal_325 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_326) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (forall ((v_ArrVal_325 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2025-02-06 10:14:18,419 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_326 (Array Int Int)) (v_ArrVal_325 (Array Int Int))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_325) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_326) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (forall ((v_ArrVal_325 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_325) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) is different from false [2025-02-06 10:14:18,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:14:18,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2025-02-06 10:14:18,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:14:18,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2025-02-06 10:14:18,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:14:18,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 61 [2025-02-06 10:14:18,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:14:18,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 89 [2025-02-06 10:14:18,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-06 10:14:18,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:14:18,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:14:18,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-02-06 10:14:18,471 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:14:18,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:14:18,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 10:14:18,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:14:18,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2025-02-06 10:14:18,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-02-06 10:14:18,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644623731] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:14:18,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:14:18,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 31 [2025-02-06 10:14:18,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023769450] [2025-02-06 10:14:18,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:14:18,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-06 10:14:18,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:18,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-06 10:14:18,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=707, Unknown=3, NotChecked=168, Total=992 [2025-02-06 10:14:18,581 INFO L87 Difference]: Start difference. First operand 147 states and 169 transitions. Second operand has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 32 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:19,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:19,404 INFO L93 Difference]: Finished difference Result 211 states and 241 transitions. [2025-02-06 10:14:19,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 10:14:19,405 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 32 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-06 10:14:19,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:19,405 INFO L225 Difference]: With dead ends: 211 [2025-02-06 10:14:19,405 INFO L226 Difference]: Without dead ends: 211 [2025-02-06 10:14:19,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=289, Invalid=1612, Unknown=3, NotChecked=258, Total=2162 [2025-02-06 10:14:19,406 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 303 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 1750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 578 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:19,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 1106 Invalid, 1750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1111 Invalid, 0 Unknown, 578 Unchecked, 0.5s Time] [2025-02-06 10:14:19,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-02-06 10:14:19,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 143. [2025-02-06 10:14:19,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 128 states have (on average 1.2734375) internal successors, (163), 142 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:19,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 163 transitions. [2025-02-06 10:14:19,409 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 163 transitions. Word has length 29 [2025-02-06 10:14:19,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:19,409 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 163 transitions. [2025-02-06 10:14:19,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 32 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:19,409 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 163 transitions. [2025-02-06 10:14:19,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 10:14:19,409 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:19,410 INFO L218 NwaCegarLoop]: trace histogram [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-02-06 10:14:19,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 10:14:19,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:14:19,610 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-02-06 10:14:19,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:19,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1404259200, now seen corresponding path program 1 times [2025-02-06 10:14:19,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:19,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755693981] [2025-02-06 10:14:19,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:19,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:19,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 10:14:19,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 10:14:19,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:19,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:19,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:19,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:19,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755693981] [2025-02-06 10:14:19,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755693981] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:14:19,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:14:19,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:14:19,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906530990] [2025-02-06 10:14:19,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:14:19,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:14:19,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:19,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:14:19,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:14:19,746 INFO L87 Difference]: Start difference. First operand 143 states and 163 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:19,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:19,845 INFO L93 Difference]: Finished difference Result 152 states and 173 transitions. [2025-02-06 10:14:19,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:14:19,846 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-02-06 10:14:19,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:19,846 INFO L225 Difference]: With dead ends: 152 [2025-02-06 10:14:19,846 INFO L226 Difference]: Without dead ends: 137 [2025-02-06 10:14:19,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:14:19,847 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 107 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:19,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 223 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:14:19,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-06 10:14:19,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 128. [2025-02-06 10:14:19,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 113 states have (on average 1.3008849557522124) internal successors, (147), 127 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:19,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 147 transitions. [2025-02-06 10:14:19,849 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 147 transitions. Word has length 32 [2025-02-06 10:14:19,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:19,849 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 147 transitions. [2025-02-06 10:14:19,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:19,849 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 147 transitions. [2025-02-06 10:14:19,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 10:14:19,849 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:19,849 INFO L218 NwaCegarLoop]: trace histogram [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-02-06 10:14:19,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 10:14:19,849 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 35 more)] === [2025-02-06 10:14:19,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:19,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1652631588, now seen corresponding path program 1 times [2025-02-06 10:14:19,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:19,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554247056] [2025-02-06 10:14:19,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:19,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:19,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 10:14:19,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 10:14:19,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:19,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:20,089 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:20,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:20,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554247056] [2025-02-06 10:14:20,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554247056] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:14:20,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723959099] [2025-02-06 10:14:20,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:20,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:14:20,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:14:20,091 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:14:20,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 10:14:20,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 10:14:20,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 10:14:20,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:20,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:20,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 10:14:20,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:14:20,206 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 10:14:20,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 10:14:20,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 10:14:20,319 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-06 10:14:20,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2025-02-06 10:14:20,333 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-06 10:14:20,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-06 10:14:20,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-06 10:14:20,434 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:20,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:14:20,504 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_401 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_401) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) 1)) is different from false [2025-02-06 10:14:20,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:14:20,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-02-06 10:14:20,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:14:20,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2025-02-06 10:14:20,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2025-02-06 10:14:21,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:14:21,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 150 treesize of output 748