./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b05b18c0458ef705f828769f88cc2a590589ce4d5c3f0e48f99be90a949f7ed4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 12:12:14,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 12:12:14,344 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 12:12:14,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 12:12:14,352 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 12:12:14,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 12:12:14,372 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 12:12:14,372 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 12:12:14,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 12:12:14,372 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 12:12:14,373 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 12:12:14,373 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 12:12:14,373 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 12:12:14,374 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 12:12:14,374 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 12:12:14,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 12:12:14,374 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 12:12:14,374 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 12:12:14,375 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 12:12:14,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 12:12:14,375 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 12:12:14,375 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 12:12:14,375 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 12:12:14,375 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 12:12:14,375 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 12:12:14,375 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 12:12:14,375 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 12:12:14,375 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 12:12:14,375 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 12:12:14,375 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 12:12:14,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 12:12:14,376 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 12:12:14,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 12:12:14,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:12:14,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 12:12:14,376 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 12:12:14,376 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 12:12:14,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 12:12:14,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 12:12:14,377 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 12:12:14,377 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 12:12:14,377 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 12:12:14,377 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b05b18c0458ef705f828769f88cc2a590589ce4d5c3f0e48f99be90a949f7ed4 [2025-03-17 12:12:14,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 12:12:14,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 12:12:14,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 12:12:14,610 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 12:12:14,610 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 12:12:14,611 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i [2025-03-17 12:12:15,708 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4248390c5/d60617d6f22649d590ac46485700bac4/FLAGa2f5d5353 [2025-03-17 12:12:15,969 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 12:12:15,969 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i [2025-03-17 12:12:15,982 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4248390c5/d60617d6f22649d590ac46485700bac4/FLAGa2f5d5353 [2025-03-17 12:12:16,278 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4248390c5/d60617d6f22649d590ac46485700bac4 [2025-03-17 12:12:16,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 12:12:16,280 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 12:12:16,281 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 12:12:16,281 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 12:12:16,284 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 12:12:16,284 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:12:16" (1/1) ... [2025-03-17 12:12:16,285 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b6fd936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:16, skipping insertion in model container [2025-03-17 12:12:16,285 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:12:16" (1/1) ... [2025-03-17 12:12:16,309 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 12:12:16,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:12:16,514 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 12:12:16,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:12:16,567 INFO L204 MainTranslator]: Completed translation [2025-03-17 12:12:16,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:16 WrapperNode [2025-03-17 12:12:16,567 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 12:12:16,568 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 12:12:16,568 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 12:12:16,568 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 12:12:16,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:16" (1/1) ... [2025-03-17 12:12:16,581 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:16" (1/1) ... [2025-03-17 12:12:16,601 INFO L138 Inliner]: procedures = 119, calls = 40, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 124 [2025-03-17 12:12:16,601 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 12:12:16,602 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 12:12:16,603 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 12:12:16,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 12:12:16,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:16" (1/1) ... [2025-03-17 12:12:16,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:16" (1/1) ... [2025-03-17 12:12:16,611 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:16" (1/1) ... [2025-03-17 12:12:16,621 INFO L175 MemorySlicer]: Split 24 memory accesses to 2 slices as follows [2, 22]. 92 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 11 writes are split as follows [0, 11]. [2025-03-17 12:12:16,621 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:16" (1/1) ... [2025-03-17 12:12:16,622 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:16" (1/1) ... [2025-03-17 12:12:16,626 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:16" (1/1) ... [2025-03-17 12:12:16,627 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:16" (1/1) ... [2025-03-17 12:12:16,628 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:16" (1/1) ... [2025-03-17 12:12:16,629 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:16" (1/1) ... [2025-03-17 12:12:16,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 12:12:16,634 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 12:12:16,634 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 12:12:16,634 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 12:12:16,635 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:16" (1/1) ... [2025-03-17 12:12:16,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:12:16,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:12:16,661 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 12:12:16,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 12:12:16,680 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-17 12:12:16,680 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-17 12:12:16,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 12:12:16,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 12:12:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 12:12:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 12:12:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 12:12:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 12:12:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 12:12:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 12:12:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 12:12:16,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 12:12:16,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 12:12:16,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 12:12:16,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 12:12:16,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 12:12:16,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 12:12:16,767 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 12:12:16,768 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 12:12:17,052 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-03-17 12:12:17,052 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 12:12:17,064 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 12:12:17,064 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 12:12:17,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:12:17 BoogieIcfgContainer [2025-03-17 12:12:17,064 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 12:12:17,066 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 12:12:17,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 12:12:17,071 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 12:12:17,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:12:16" (1/3) ... [2025-03-17 12:12:17,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5436764b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:12:17, skipping insertion in model container [2025-03-17 12:12:17,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:12:16" (2/3) ... [2025-03-17 12:12:17,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5436764b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:12:17, skipping insertion in model container [2025-03-17 12:12:17,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:12:17" (3/3) ... [2025-03-17 12:12:17,074 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel-1.i [2025-03-17 12:12:17,084 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 12:12:17,086 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-rb-sentinel-1.i that has 2 procedures, 137 locations, 1 initial locations, 7 loop locations, and 58 error locations. [2025-03-17 12:12:17,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 12:12:17,121 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;@1f9c591a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 12:12:17,122 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2025-03-17 12:12:17,125 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 73 states have (on average 2.0684931506849313) internal successors, (151), 131 states have internal predecessors, (151), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 12:12:17,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 12:12:17,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:17,128 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 12:12:17,129 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-17 12:12:17,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:17,132 INFO L85 PathProgramCache]: Analyzing trace with hash 5919, now seen corresponding path program 1 times [2025-03-17 12:12:17,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:17,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682809729] [2025-03-17 12:12:17,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:17,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:17,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 12:12:17,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 12:12:17,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:17,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:17,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:17,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:17,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682809729] [2025-03-17 12:12:17,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682809729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:17,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:17,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 12:12:17,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085167155] [2025-03-17 12:12:17,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:17,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:12:17,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:17,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:12:17,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:12:17,314 INFO L87 Difference]: Start difference. First operand has 137 states, 73 states have (on average 2.0684931506849313) internal successors, (151), 131 states have internal predecessors, (151), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-17 12:12:17,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:17,436 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2025-03-17 12:12:17,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:12:17,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-03-17 12:12:17,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:17,442 INFO L225 Difference]: With dead ends: 158 [2025-03-17 12:12:17,442 INFO L226 Difference]: Without dead ends: 156 [2025-03-17 12:12:17,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:12:17,445 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 107 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:17,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 103 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:12:17,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-17 12:12:17,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 131. [2025-03-17 12:12:17,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 71 states have (on average 1.943661971830986) internal successors, (138), 129 states have internal predecessors, (138), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:17,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2025-03-17 12:12:17,469 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 2 [2025-03-17 12:12:17,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:17,469 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2025-03-17 12:12:17,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-17 12:12:17,484 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2025-03-17 12:12:17,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 12:12:17,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:17,484 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 12:12:17,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 12:12:17,484 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-17 12:12:17,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:17,485 INFO L85 PathProgramCache]: Analyzing trace with hash 5920, now seen corresponding path program 1 times [2025-03-17 12:12:17,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:17,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722811207] [2025-03-17 12:12:17,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:17,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:17,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 12:12:17,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 12:12:17,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:17,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:17,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:17,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:17,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722811207] [2025-03-17 12:12:17,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722811207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:17,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:17,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 12:12:17,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863475472] [2025-03-17 12:12:17,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:17,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:12:17,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:17,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:12:17,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:12:17,536 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-17 12:12:17,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:17,602 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2025-03-17 12:12:17,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:12:17,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-03-17 12:12:17,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:17,603 INFO L225 Difference]: With dead ends: 129 [2025-03-17 12:12:17,603 INFO L226 Difference]: Without dead ends: 129 [2025-03-17 12:12:17,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:12:17,604 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 2 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:17,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 203 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:12:17,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-17 12:12:17,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-03-17 12:12:17,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 71 states have (on average 1.9154929577464788) internal successors, (136), 127 states have internal predecessors, (136), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:17,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2025-03-17 12:12:17,609 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 2 [2025-03-17 12:12:17,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:17,609 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2025-03-17 12:12:17,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-03-17 12:12:17,609 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2025-03-17 12:12:17,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 12:12:17,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:17,610 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 12:12:17,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 12:12:17,610 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-17 12:12:17,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:17,611 INFO L85 PathProgramCache]: Analyzing trace with hash 176451061, now seen corresponding path program 1 times [2025-03-17 12:12:17,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:17,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217811552] [2025-03-17 12:12:17,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:17,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:17,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 12:12:17,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 12:12:17,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:17,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:17,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:17,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:17,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217811552] [2025-03-17 12:12:17,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217811552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:17,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:17,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:12:17,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158326992] [2025-03-17 12:12:17,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:17,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:12:17,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:17,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:12:17,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:12:17,702 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-03-17 12:12:17,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:17,796 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2025-03-17 12:12:17,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:12:17,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-03-17 12:12:17,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:17,797 INFO L225 Difference]: With dead ends: 124 [2025-03-17 12:12:17,797 INFO L226 Difference]: Without dead ends: 124 [2025-03-17 12:12:17,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:12:17,798 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 87 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:17,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 88 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:12:17,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-17 12:12:17,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-03-17 12:12:17,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 72 states have (on average 1.8333333333333333) internal successors, (132), 122 states have internal predecessors, (132), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:17,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2025-03-17 12:12:17,802 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 5 [2025-03-17 12:12:17,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:17,802 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2025-03-17 12:12:17,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-03-17 12:12:17,802 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2025-03-17 12:12:17,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 12:12:17,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:17,803 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 12:12:17,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 12:12:17,803 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-17 12:12:17,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:17,803 INFO L85 PathProgramCache]: Analyzing trace with hash 176451062, now seen corresponding path program 1 times [2025-03-17 12:12:17,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:17,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339363847] [2025-03-17 12:12:17,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:17,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:17,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 12:12:17,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 12:12:17,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:17,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:17,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:17,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:17,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339363847] [2025-03-17 12:12:17,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339363847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:17,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:17,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:12:17,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083566849] [2025-03-17 12:12:17,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:17,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:12:17,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:17,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:12:17,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:12:17,867 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-03-17 12:12:17,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:17,938 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2025-03-17 12:12:17,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:12:17,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-03-17 12:12:17,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:17,940 INFO L225 Difference]: With dead ends: 129 [2025-03-17 12:12:17,940 INFO L226 Difference]: Without dead ends: 129 [2025-03-17 12:12:17,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:12:17,941 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 81 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:17,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 104 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:12:17,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-17 12:12:17,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-03-17 12:12:17,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 79 states have (on average 1.7341772151898733) internal successors, (137), 127 states have internal predecessors, (137), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:17,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 141 transitions. [2025-03-17 12:12:17,947 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 141 transitions. Word has length 5 [2025-03-17 12:12:17,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:17,947 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 141 transitions. [2025-03-17 12:12:17,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-03-17 12:12:17,948 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 141 transitions. [2025-03-17 12:12:17,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 12:12:17,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:17,948 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:12:17,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 12:12:17,948 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-17 12:12:17,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:17,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1867946125, now seen corresponding path program 1 times [2025-03-17 12:12:17,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:17,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999483817] [2025-03-17 12:12:17,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:17,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:17,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 12:12:17,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 12:12:17,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:17,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:18,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:18,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:18,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999483817] [2025-03-17 12:12:18,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999483817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:18,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:18,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:12:18,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456016737] [2025-03-17 12:12:18,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:18,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:12:18,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:18,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:12:18,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:12:18,079 INFO L87 Difference]: Start difference. First operand 129 states and 141 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-03-17 12:12:18,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:18,218 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2025-03-17 12:12:18,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:12:18,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2025-03-17 12:12:18,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:18,220 INFO L225 Difference]: With dead ends: 120 [2025-03-17 12:12:18,220 INFO L226 Difference]: Without dead ends: 120 [2025-03-17 12:12:18,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:12:18,221 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 108 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:18,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 82 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:12:18,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-17 12:12:18,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-17 12:12:18,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 81 states have (on average 1.6049382716049383) internal successors, (130), 118 states have internal predecessors, (130), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:18,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 134 transitions. [2025-03-17 12:12:18,226 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 134 transitions. Word has length 10 [2025-03-17 12:12:18,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:18,227 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 134 transitions. [2025-03-17 12:12:18,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-03-17 12:12:18,227 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 134 transitions. [2025-03-17 12:12:18,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 12:12:18,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:18,227 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:12:18,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 12:12:18,227 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-17 12:12:18,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:18,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1867946124, now seen corresponding path program 1 times [2025-03-17 12:12:18,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:18,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513241136] [2025-03-17 12:12:18,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:18,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:18,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 12:12:18,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 12:12:18,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:18,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:18,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:18,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:18,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513241136] [2025-03-17 12:12:18,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513241136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:18,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:18,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:12:18,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077041539] [2025-03-17 12:12:18,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:18,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:12:18,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:18,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:12:18,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:12:18,336 INFO L87 Difference]: Start difference. First operand 120 states and 134 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-03-17 12:12:18,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:18,463 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2025-03-17 12:12:18,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 12:12:18,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2025-03-17 12:12:18,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:18,464 INFO L225 Difference]: With dead ends: 128 [2025-03-17 12:12:18,464 INFO L226 Difference]: Without dead ends: 128 [2025-03-17 12:12:18,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:12:18,464 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 95 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:18,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 121 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:12:18,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-17 12:12:18,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2025-03-17 12:12:18,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 89 states have (on average 1.550561797752809) internal successors, (138), 125 states have internal predecessors, (138), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:18,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 142 transitions. [2025-03-17 12:12:18,471 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 142 transitions. Word has length 10 [2025-03-17 12:12:18,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:18,471 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 142 transitions. [2025-03-17 12:12:18,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-03-17 12:12:18,471 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 142 transitions. [2025-03-17 12:12:18,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 12:12:18,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:18,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:12:18,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 12:12:18,471 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-17 12:12:18,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:18,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1030978029, now seen corresponding path program 1 times [2025-03-17 12:12:18,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:18,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826152392] [2025-03-17 12:12:18,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:18,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:18,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 12:12:18,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 12:12:18,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:18,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:18,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:18,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:18,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826152392] [2025-03-17 12:12:18,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826152392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:18,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:18,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:12:18,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825343523] [2025-03-17 12:12:18,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:18,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:12:18,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:18,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:12:18,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:12:18,539 INFO L87 Difference]: Start difference. First operand 127 states and 142 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:18,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:18,684 INFO L93 Difference]: Finished difference Result 162 states and 177 transitions. [2025-03-17 12:12:18,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:12:18,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-17 12:12:18,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:18,686 INFO L225 Difference]: With dead ends: 162 [2025-03-17 12:12:18,686 INFO L226 Difference]: Without dead ends: 162 [2025-03-17 12:12:18,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:12:18,686 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 215 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:18,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 140 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:12:18,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-17 12:12:18,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 129. [2025-03-17 12:12:18,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 92 states have (on average 1.5217391304347827) internal successors, (140), 127 states have internal predecessors, (140), 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-03-17 12:12:18,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 143 transitions. [2025-03-17 12:12:18,690 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 143 transitions. Word has length 14 [2025-03-17 12:12:18,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:18,690 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 143 transitions. [2025-03-17 12:12:18,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:18,691 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 143 transitions. [2025-03-17 12:12:18,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 12:12:18,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:18,691 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:12:18,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 12:12:18,691 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-17 12:12:18,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:18,691 INFO L85 PathProgramCache]: Analyzing trace with hash -970859667, now seen corresponding path program 1 times [2025-03-17 12:12:18,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:18,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254471581] [2025-03-17 12:12:18,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:18,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:18,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 12:12:18,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 12:12:18,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:18,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:18,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:18,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:18,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254471581] [2025-03-17 12:12:18,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254471581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:18,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:18,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:12:18,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101842856] [2025-03-17 12:12:18,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:18,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:12:18,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:18,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:12:18,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:12:18,785 INFO L87 Difference]: Start difference. First operand 129 states and 143 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-03-17 12:12:18,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:18,941 INFO L93 Difference]: Finished difference Result 129 states and 143 transitions. [2025-03-17 12:12:18,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:12:18,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 14 [2025-03-17 12:12:18,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:18,942 INFO L225 Difference]: With dead ends: 129 [2025-03-17 12:12:18,942 INFO L226 Difference]: Without dead ends: 129 [2025-03-17 12:12:18,942 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-03-17 12:12:18,943 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 27 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:18,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 272 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:12:18,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-17 12:12:18,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2025-03-17 12:12:18,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 92 states have (on average 1.5108695652173914) internal successors, (139), 126 states have internal predecessors, (139), 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-03-17 12:12:18,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 142 transitions. [2025-03-17 12:12:18,949 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 142 transitions. Word has length 14 [2025-03-17 12:12:18,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:18,949 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 142 transitions. [2025-03-17 12:12:18,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-03-17 12:12:18,949 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 142 transitions. [2025-03-17 12:12:18,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 12:12:18,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:18,950 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:12:18,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 12:12:18,951 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-17 12:12:18,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:18,951 INFO L85 PathProgramCache]: Analyzing trace with hash -970859666, now seen corresponding path program 1 times [2025-03-17 12:12:18,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:18,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170279079] [2025-03-17 12:12:18,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:18,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:18,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 12:12:18,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 12:12:18,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:18,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:19,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:19,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:19,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170279079] [2025-03-17 12:12:19,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170279079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:19,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:19,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:12:19,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447792565] [2025-03-17 12:12:19,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:19,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:12:19,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:19,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:12:19,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:12:19,118 INFO L87 Difference]: Start difference. First operand 128 states and 142 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-03-17 12:12:19,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:19,273 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2025-03-17 12:12:19,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:12:19,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 14 [2025-03-17 12:12:19,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:19,274 INFO L225 Difference]: With dead ends: 129 [2025-03-17 12:12:19,274 INFO L226 Difference]: Without dead ends: 129 [2025-03-17 12:12:19,274 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-03-17 12:12:19,275 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 13 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:19,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 321 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:12:19,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-17 12:12:19,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2025-03-17 12:12:19,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 92 states have (on average 1.4565217391304348) internal successors, (134), 121 states have internal predecessors, (134), 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-03-17 12:12:19,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 137 transitions. [2025-03-17 12:12:19,279 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 137 transitions. Word has length 14 [2025-03-17 12:12:19,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:19,280 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 137 transitions. [2025-03-17 12:12:19,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-03-17 12:12:19,280 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 137 transitions. [2025-03-17 12:12:19,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 12:12:19,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:19,281 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:12:19,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 12:12:19,281 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-17 12:12:19,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:19,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1590678797, now seen corresponding path program 1 times [2025-03-17 12:12:19,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:19,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372854327] [2025-03-17 12:12:19,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:19,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:19,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 12:12:19,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 12:12:19,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:19,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:19,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:19,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:19,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372854327] [2025-03-17 12:12:19,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372854327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:19,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:19,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 12:12:19,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273794913] [2025-03-17 12:12:19,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:19,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:12:19,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:19,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:12:19,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:12:19,451 INFO L87 Difference]: Start difference. First operand 123 states and 137 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:19,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:19,623 INFO L93 Difference]: Finished difference Result 169 states and 189 transitions. [2025-03-17 12:12:19,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:12:19,623 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-17 12:12:19,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:19,624 INFO L225 Difference]: With dead ends: 169 [2025-03-17 12:12:19,624 INFO L226 Difference]: Without dead ends: 169 [2025-03-17 12:12:19,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-17 12:12:19,625 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 320 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:19,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 253 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:12:19,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-17 12:12:19,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 129. [2025-03-17 12:12:19,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 99 states have (on average 1.4141414141414141) internal successors, (140), 127 states have internal predecessors, (140), 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-03-17 12:12:19,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 143 transitions. [2025-03-17 12:12:19,629 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 143 transitions. Word has length 17 [2025-03-17 12:12:19,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:19,629 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 143 transitions. [2025-03-17 12:12:19,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:19,629 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 143 transitions. [2025-03-17 12:12:19,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 12:12:19,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:19,630 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] [2025-03-17 12:12:19,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 12:12:19,630 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-17 12:12:19,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:19,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1138985126, now seen corresponding path program 1 times [2025-03-17 12:12:19,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:19,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040230450] [2025-03-17 12:12:19,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:19,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:19,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 12:12:19,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 12:12:19,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:19,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:19,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:19,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:19,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040230450] [2025-03-17 12:12:19,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040230450] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:12:19,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344757915] [2025-03-17 12:12:19,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:19,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:12:19,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:12:19,833 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:12:19,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 12:12:19,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 12:12:19,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 12:12:19,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:19,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:19,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 12:12:19,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:12:19,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:12:19,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:12:20,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 12:12:20,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 12:12:20,158 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 15 treesize of output 7 [2025-03-17 12:12:20,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:20,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:12:20,426 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 10 treesize of output 8 [2025-03-17 12:12:20,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-17 12:12:20,441 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 10 treesize of output 8 [2025-03-17 12:12:20,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:12:20,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:20,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344757915] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:12:20,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:12:20,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 15 [2025-03-17 12:12:20,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102722684] [2025-03-17 12:12:20,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:12:20,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 12:12:20,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:20,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 12:12:20,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-17 12:12:20,456 INFO L87 Difference]: Start difference. First operand 129 states and 143 transitions. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:20,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:20,789 INFO L93 Difference]: Finished difference Result 167 states and 187 transitions. [2025-03-17 12:12:20,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:12:20,789 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-17 12:12:20,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:20,790 INFO L225 Difference]: With dead ends: 167 [2025-03-17 12:12:20,790 INFO L226 Difference]: Without dead ends: 167 [2025-03-17 12:12:20,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-17 12:12:20,791 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 168 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:20,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 511 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:12:20,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-17 12:12:20,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 136. [2025-03-17 12:12:20,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 106 states have (on average 1.3962264150943395) internal successors, (148), 134 states have internal predecessors, (148), 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-03-17 12:12:20,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 151 transitions. [2025-03-17 12:12:20,794 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 151 transitions. Word has length 22 [2025-03-17 12:12:20,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:20,794 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 151 transitions. [2025-03-17 12:12:20,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:20,794 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 151 transitions. [2025-03-17 12:12:20,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 12:12:20,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:20,794 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-03-17 12:12:20,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 12:12:20,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 12:12:20,999 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-17 12:12:20,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:20,999 INFO L85 PathProgramCache]: Analyzing trace with hash -919131520, now seen corresponding path program 1 times [2025-03-17 12:12:20,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:20,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144723098] [2025-03-17 12:12:21,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:21,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:21,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 12:12:21,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 12:12:21,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:21,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:21,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:21,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:21,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144723098] [2025-03-17 12:12:21,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144723098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:21,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:21,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:12:21,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106757692] [2025-03-17 12:12:21,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:21,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:12:21,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:21,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:12:21,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:12:21,040 INFO L87 Difference]: Start difference. First operand 136 states and 151 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:21,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:21,127 INFO L93 Difference]: Finished difference Result 138 states and 151 transitions. [2025-03-17 12:12:21,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:12:21,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-17 12:12:21,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:21,128 INFO L225 Difference]: With dead ends: 138 [2025-03-17 12:12:21,128 INFO L226 Difference]: Without dead ends: 138 [2025-03-17 12:12:21,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-03-17 12:12:21,129 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 6 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:21,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 300 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:12:21,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-17 12:12:21,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2025-03-17 12:12:21,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 105 states have (on average 1.380952380952381) internal successors, (145), 133 states have internal predecessors, (145), 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-03-17 12:12:21,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 148 transitions. [2025-03-17 12:12:21,133 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 148 transitions. Word has length 24 [2025-03-17 12:12:21,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:21,133 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 148 transitions. [2025-03-17 12:12:21,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:21,133 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 148 transitions. [2025-03-17 12:12:21,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 12:12:21,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:21,133 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] [2025-03-17 12:12:21,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 12:12:21,133 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-17 12:12:21,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:21,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1763939836, now seen corresponding path program 1 times [2025-03-17 12:12:21,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:21,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744186530] [2025-03-17 12:12:21,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:21,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:21,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 12:12:21,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 12:12:21,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:21,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:21,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:21,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:21,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744186530] [2025-03-17 12:12:21,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744186530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:21,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:21,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:12:21,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923507808] [2025-03-17 12:12:21,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:21,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:12:21,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:21,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:12:21,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:12:21,248 INFO L87 Difference]: Start difference. First operand 135 states and 148 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-03-17 12:12:21,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:21,378 INFO L93 Difference]: Finished difference Result 135 states and 148 transitions. [2025-03-17 12:12:21,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:12:21,379 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-03-17 12:12:21,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:21,379 INFO L225 Difference]: With dead ends: 135 [2025-03-17 12:12:21,379 INFO L226 Difference]: Without dead ends: 135 [2025-03-17 12:12:21,379 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-03-17 12:12:21,380 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 26 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:21,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 264 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:12:21,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-17 12:12:21,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2025-03-17 12:12:21,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 105 states have (on average 1.3714285714285714) internal successors, (144), 132 states have internal predecessors, (144), 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-03-17 12:12:21,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 147 transitions. [2025-03-17 12:12:21,382 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 147 transitions. Word has length 23 [2025-03-17 12:12:21,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:21,382 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 147 transitions. [2025-03-17 12:12:21,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-03-17 12:12:21,382 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 147 transitions. [2025-03-17 12:12:21,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 12:12:21,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:21,383 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] [2025-03-17 12:12:21,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 12:12:21,383 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-17 12:12:21,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:21,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1763939835, now seen corresponding path program 1 times [2025-03-17 12:12:21,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:21,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420725090] [2025-03-17 12:12:21,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:21,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:21,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 12:12:21,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 12:12:21,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:21,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:21,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:21,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:21,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420725090] [2025-03-17 12:12:21,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420725090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:21,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:21,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:12:21,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533311259] [2025-03-17 12:12:21,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:21,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:12:21,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:21,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:12:21,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:12:21,559 INFO L87 Difference]: Start difference. First operand 134 states and 147 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-03-17 12:12:21,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:21,672 INFO L93 Difference]: Finished difference Result 131 states and 144 transitions. [2025-03-17 12:12:21,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:12:21,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-03-17 12:12:21,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:21,673 INFO L225 Difference]: With dead ends: 131 [2025-03-17 12:12:21,673 INFO L226 Difference]: Without dead ends: 131 [2025-03-17 12:12:21,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:12:21,674 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 6 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:21,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 321 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:12:21,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-17 12:12:21,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 125. [2025-03-17 12:12:21,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 100 states have (on average 1.34) internal successors, (134), 123 states have internal predecessors, (134), 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-03-17 12:12:21,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2025-03-17 12:12:21,676 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 23 [2025-03-17 12:12:21,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:21,676 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2025-03-17 12:12:21,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-03-17 12:12:21,676 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2025-03-17 12:12:21,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 12:12:21,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:21,677 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] [2025-03-17 12:12:21,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 12:12:21,677 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-17 12:12:21,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:21,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1361875796, now seen corresponding path program 1 times [2025-03-17 12:12:21,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:21,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899994026] [2025-03-17 12:12:21,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:21,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:21,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:12:21,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:12:21,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:21,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:22,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:22,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:22,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899994026] [2025-03-17 12:12:22,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899994026] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:12:22,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664262789] [2025-03-17 12:12:22,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:22,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:12:22,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:12:22,018 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:12:22,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 12:12:22,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:12:22,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:12:22,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:22,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:22,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 12:12:22,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:12:22,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:12:22,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:12:22,186 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:12:22,186 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-03-17 12:12:22,210 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 15 treesize of output 1 [2025-03-17 12:12:22,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:12:22,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 12:12:22,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-17 12:12:22,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:12:22,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:12:22,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:22,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:12:22,388 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_529 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_529) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 1)) is different from false [2025-03-17 12:12:23,581 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:12:23,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:23,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2025-03-17 12:12:23,589 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 36 treesize of output 24 [2025-03-17 12:12:23,591 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-03-17 12:12:25,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:25,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664262789] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:12:25,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:12:25,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 31 [2025-03-17 12:12:25,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431511187] [2025-03-17 12:12:25,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:12:25,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-17 12:12:25,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:25,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-17 12:12:25,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=711, Unknown=21, NotChecked=56, Total=930 [2025-03-17 12:12:25,437 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 31 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:26,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:26,248 INFO L93 Difference]: Finished difference Result 184 states and 203 transitions. [2025-03-17 12:12:26,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 12:12:26,248 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 31 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-17 12:12:26,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:26,249 INFO L225 Difference]: With dead ends: 184 [2025-03-17 12:12:26,249 INFO L226 Difference]: Without dead ends: 184 [2025-03-17 12:12:26,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=370, Invalid=1335, Unknown=21, NotChecked=80, Total=1806 [2025-03-17 12:12:26,250 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 597 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:26,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 548 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 877 Invalid, 0 Unknown, 165 Unchecked, 0.5s Time] [2025-03-17 12:12:26,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-17 12:12:26,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 140. [2025-03-17 12:12:26,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 115 states have (on average 1.3130434782608695) internal successors, (151), 138 states have internal predecessors, (151), 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-03-17 12:12:26,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2025-03-17 12:12:26,253 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 27 [2025-03-17 12:12:26,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:26,253 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2025-03-17 12:12:26,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 31 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:26,253 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2025-03-17 12:12:26,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 12:12:26,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:26,254 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] [2025-03-17 12:12:26,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 12:12:26,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 12:12:26,454 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-17 12:12:26,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:26,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1376297383, now seen corresponding path program 1 times [2025-03-17 12:12:26,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:26,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615518638] [2025-03-17 12:12:26,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:26,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:26,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:12:26,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:12:26,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:26,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:26,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:12:26,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:26,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615518638] [2025-03-17 12:12:26,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615518638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:26,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:26,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:12:26,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632598530] [2025-03-17 12:12:26,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:26,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:12:26,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:26,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:12:26,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:12:26,480 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:26,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:26,511 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2025-03-17 12:12:26,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:12:26,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-17 12:12:26,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:26,512 INFO L225 Difference]: With dead ends: 141 [2025-03-17 12:12:26,512 INFO L226 Difference]: Without dead ends: 141 [2025-03-17 12:12:26,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:12:26,512 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 41 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:26,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 107 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:12:26,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-17 12:12:26,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-03-17 12:12:26,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 116 states have (on average 1.3017241379310345) internal successors, (151), 139 states have internal predecessors, (151), 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-03-17 12:12:26,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 154 transitions. [2025-03-17 12:12:26,515 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 154 transitions. Word has length 28 [2025-03-17 12:12:26,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:26,515 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 154 transitions. [2025-03-17 12:12:26,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:26,515 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 154 transitions. [2025-03-17 12:12:26,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 12:12:26,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:26,516 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, 1] [2025-03-17 12:12:26,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 12:12:26,516 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-17 12:12:26,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:26,516 INFO L85 PathProgramCache]: Analyzing trace with hash 228141878, now seen corresponding path program 1 times [2025-03-17 12:12:26,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:26,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134081385] [2025-03-17 12:12:26,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:26,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:26,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:12:26,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:12:26,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:26,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:26,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:26,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:26,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134081385] [2025-03-17 12:12:26,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134081385] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:12:26,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296084512] [2025-03-17 12:12:26,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:26,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:12:26,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:12:26,598 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:12:26,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 12:12:26,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:12:26,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:12:26,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:26,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:26,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 12:12:26,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:12:26,675 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-03-17 12:12:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:12:26,703 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:12:26,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296084512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:26,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:12:26,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2025-03-17 12:12:26,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768695099] [2025-03-17 12:12:26,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:26,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:12:26,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:26,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:12:26,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 12:12:26,704 INFO L87 Difference]: Start difference. First operand 141 states and 154 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-03-17 12:12:26,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:26,758 INFO L93 Difference]: Finished difference Result 148 states and 161 transitions. [2025-03-17 12:12:26,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 12:12:26,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 30 [2025-03-17 12:12:26,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:26,759 INFO L225 Difference]: With dead ends: 148 [2025-03-17 12:12:26,759 INFO L226 Difference]: Without dead ends: 148 [2025-03-17 12:12:26,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 12:12:26,759 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 5 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:26,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 237 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:12:26,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-17 12:12:26,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2025-03-17 12:12:26,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 119 states have (on average 1.2941176470588236) internal successors, (154), 142 states have internal predecessors, (154), 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-03-17 12:12:26,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 157 transitions. [2025-03-17 12:12:26,762 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 157 transitions. Word has length 30 [2025-03-17 12:12:26,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:26,762 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 157 transitions. [2025-03-17 12:12:26,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-03-17 12:12:26,762 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 157 transitions. [2025-03-17 12:12:26,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 12:12:26,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:26,762 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] [2025-03-17 12:12:26,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 12:12:26,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:12:26,968 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-17 12:12:26,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:26,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1971532573, now seen corresponding path program 1 times [2025-03-17 12:12:26,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:26,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139039069] [2025-03-17 12:12:26,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:26,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:26,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 12:12:26,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 12:12:26,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:26,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:27,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:27,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:27,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139039069] [2025-03-17 12:12:27,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139039069] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:12:27,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629667288] [2025-03-17 12:12:27,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:27,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:12:27,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:12:27,122 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:12:27,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 12:12:27,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 12:12:27,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 12:12:27,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:27,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:27,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 12:12:27,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:12:27,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:12:27,226 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:12:27,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-17 12:12:27,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:12:27,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 12:12:27,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 12:12:27,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:12:27,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:12:27,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:12:27,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:12:27,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629667288] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:12:27,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:12:27,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 19 [2025-03-17 12:12:27,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713783281] [2025-03-17 12:12:27,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:12:27,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 12:12:27,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:27,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 12:12:27,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2025-03-17 12:12:27,676 INFO L87 Difference]: Start difference. First operand 144 states and 157 transitions. Second operand has 19 states, 19 states have (on average 4.421052631578948) internal successors, (84), 19 states have internal predecessors, (84), 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-03-17 12:12:28,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:28,335 INFO L93 Difference]: Finished difference Result 167 states and 187 transitions. [2025-03-17 12:12:28,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 12:12:28,335 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.421052631578948) internal successors, (84), 19 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-17 12:12:28,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:28,336 INFO L225 Difference]: With dead ends: 167 [2025-03-17 12:12:28,336 INFO L226 Difference]: Without dead ends: 167 [2025-03-17 12:12:28,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=237, Invalid=953, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 12:12:28,337 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 354 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:28,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 445 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 12:12:28,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-17 12:12:28,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 155. [2025-03-17 12:12:28,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 153 states have internal predecessors, (167), 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-03-17 12:12:28,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 170 transitions. [2025-03-17 12:12:28,339 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 170 transitions. Word has length 31 [2025-03-17 12:12:28,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:28,340 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 170 transitions. [2025-03-17 12:12:28,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.421052631578948) internal successors, (84), 19 states have internal predecessors, (84), 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-03-17 12:12:28,340 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 170 transitions. [2025-03-17 12:12:28,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 12:12:28,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:28,341 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, 1, 1, 1] [2025-03-17 12:12:28,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 12:12:28,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 12:12:28,542 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-17 12:12:28,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:28,542 INFO L85 PathProgramCache]: Analyzing trace with hash 987967505, now seen corresponding path program 1 times [2025-03-17 12:12:28,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:28,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197086812] [2025-03-17 12:12:28,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:28,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:28,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 12:12:28,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 12:12:28,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:28,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:28,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 12:12:28,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:28,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197086812] [2025-03-17 12:12:28,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197086812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:12:28,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:12:28,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 12:12:28,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572909058] [2025-03-17 12:12:28,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:12:28,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:12:28,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:28,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:12:28,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:12:28,572 INFO L87 Difference]: Start difference. First operand 155 states and 170 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 2 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-03-17 12:12:28,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:28,594 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2025-03-17 12:12:28,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:12:28,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 2 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-03-17 12:12:28,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:28,595 INFO L225 Difference]: With dead ends: 154 [2025-03-17 12:12:28,595 INFO L226 Difference]: Without dead ends: 154 [2025-03-17 12:12:28,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:12:28,596 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 59 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:28,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 77 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:12:28,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-17 12:12:28,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-03-17 12:12:28,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 130 states have (on average 1.2692307692307692) internal successors, (165), 152 states have internal predecessors, (165), 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-03-17 12:12:28,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions. [2025-03-17 12:12:28,598 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 32 [2025-03-17 12:12:28,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:28,598 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 168 transitions. [2025-03-17 12:12:28,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 2 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-03-17 12:12:28,598 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2025-03-17 12:12:28,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 12:12:28,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:28,598 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:12:28,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 12:12:28,599 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-17 12:12:28,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:28,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1792111245, now seen corresponding path program 1 times [2025-03-17 12:12:28,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:28,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94521337] [2025-03-17 12:12:28,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:28,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:28,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 12:12:28,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 12:12:28,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:28,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:28,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:28,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:28,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94521337] [2025-03-17 12:12:28,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94521337] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:12:28,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229692842] [2025-03-17 12:12:28,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:28,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:12:28,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:12:28,808 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:12:28,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 12:12:28,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 12:12:28,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 12:12:28,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:28,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:28,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 12:12:28,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:12:28,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:12:28,949 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 12:12:28,949 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-03-17 12:12:28,984 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 15 treesize of output 1 [2025-03-17 12:12:29,078 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-17 12:12:29,079 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 33 treesize of output 24 [2025-03-17 12:12:29,105 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 12:12:29,106 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 34 treesize of output 33 [2025-03-17 12:12:29,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 12:12:29,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:29,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:12:29,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:29,472 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 20 treesize of output 21 [2025-03-17 12:12:29,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:29,479 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 34 treesize of output 37 [2025-03-17 12:12:29,482 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 9 [2025-03-17 12:12:29,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:29,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229692842] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:12:29,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:12:29,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 31 [2025-03-17 12:12:29,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015992002] [2025-03-17 12:12:29,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:12:29,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-17 12:12:29,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:29,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 12:12:29,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=844, Unknown=10, NotChecked=0, Total=992 [2025-03-17 12:12:29,858 INFO L87 Difference]: Start difference. First operand 154 states and 168 transitions. Second operand has 32 states, 31 states have (on average 2.806451612903226) internal successors, (87), 32 states have internal predecessors, (87), 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-03-17 12:12:30,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:30,657 INFO L93 Difference]: Finished difference Result 250 states and 278 transitions. [2025-03-17 12:12:30,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 12:12:30,657 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.806451612903226) internal successors, (87), 32 states have internal predecessors, (87), 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-03-17 12:12:30,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:30,658 INFO L225 Difference]: With dead ends: 250 [2025-03-17 12:12:30,658 INFO L226 Difference]: Without dead ends: 250 [2025-03-17 12:12:30,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=237, Invalid=1313, Unknown=10, NotChecked=0, Total=1560 [2025-03-17 12:12:30,658 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 409 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 1277 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:30,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 613 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1277 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 12:12:30,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-17 12:12:30,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 177. [2025-03-17 12:12:30,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 153 states have (on average 1.2549019607843137) internal successors, (192), 175 states have internal predecessors, (192), 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-03-17 12:12:30,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 195 transitions. [2025-03-17 12:12:30,661 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 195 transitions. Word has length 32 [2025-03-17 12:12:30,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:30,662 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 195 transitions. [2025-03-17 12:12:30,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.806451612903226) internal successors, (87), 32 states have internal predecessors, (87), 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-03-17 12:12:30,662 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 195 transitions. [2025-03-17 12:12:30,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 12:12:30,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:30,662 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:12:30,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 12:12:30,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:12:30,863 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-17 12:12:30,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:30,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1792111246, now seen corresponding path program 1 times [2025-03-17 12:12:30,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:30,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448570883] [2025-03-17 12:12:30,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:30,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:30,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 12:12:30,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 12:12:30,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:30,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:31,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:31,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:31,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448570883] [2025-03-17 12:12:31,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448570883] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:12:31,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129006] [2025-03-17 12:12:31,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:31,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:12:31,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:12:31,170 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:12:31,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 12:12:31,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 12:12:31,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 12:12:31,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:31,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:31,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-17 12:12:31,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:12:31,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:12:31,313 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:12:31,313 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-03-17 12:12:31,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2025-03-17 12:12:31,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:12:31,359 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 15 treesize of output 1 [2025-03-17 12:12:31,459 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-17 12:12:31,460 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 33 treesize of output 24 [2025-03-17 12:12:31,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:12:31,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:12:31,522 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 12:12:31,522 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 50 treesize of output 45 [2025-03-17 12:12:31,530 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 24 treesize of output 11 [2025-03-17 12:12:31,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 12:12:31,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 12:12:31,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:31,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:12:31,860 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_915 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_73| Int)) (or (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_73|) (< |v_ULTIMATE.start_main_~end~0#1.offset_73| 0) (< 0 (+ 5 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_915) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_73|))))) (forall ((v_ArrVal_915 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_73| Int) (v_ArrVal_916 (Array Int Int))) (or (< (+ 7 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_915) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_73|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_916) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_73|))) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_73|) (< |v_ULTIMATE.start_main_~end~0#1.offset_73| 0)))) is different from false [2025-03-17 12:12:32,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:32,059 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 37 treesize of output 38 [2025-03-17 12:12:32,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:32,064 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 29 treesize of output 30 [2025-03-17 12:12:32,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:32,073 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 52 treesize of output 55 [2025-03-17 12:12:32,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:32,082 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 82 treesize of output 81 [2025-03-17 12:12:32,088 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 13 [2025-03-17 12:12:32,092 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 13 treesize of output 11 [2025-03-17 12:12:32,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:32,127 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 20 treesize of output 21 [2025-03-17 12:12:32,133 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:12:32,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:12:32,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:12:32,136 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-17 12:12:32,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:32,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129006] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:12:32,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:12:32,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 33 [2025-03-17 12:12:32,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532172894] [2025-03-17 12:12:32,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:12:32,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-17 12:12:32,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:32,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-17 12:12:32,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=945, Unknown=12, NotChecked=62, Total=1122 [2025-03-17 12:12:32,295 INFO L87 Difference]: Start difference. First operand 177 states and 195 transitions. Second operand has 34 states, 33 states have (on average 2.727272727272727) internal successors, (90), 34 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:33,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:33,367 INFO L93 Difference]: Finished difference Result 227 states and 251 transitions. [2025-03-17 12:12:33,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 12:12:33,367 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.727272727272727) internal successors, (90), 34 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-17 12:12:33,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:33,368 INFO L225 Difference]: With dead ends: 227 [2025-03-17 12:12:33,368 INFO L226 Difference]: Without dead ends: 227 [2025-03-17 12:12:33,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=316, Invalid=2027, Unknown=13, NotChecked=94, Total=2450 [2025-03-17 12:12:33,369 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 494 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 1747 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 1988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 178 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:33,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 876 Invalid, 1988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1747 Invalid, 0 Unknown, 178 Unchecked, 0.7s Time] [2025-03-17 12:12:33,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-17 12:12:33,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 180. [2025-03-17 12:12:33,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 156 states have (on average 1.25) internal successors, (195), 178 states have internal predecessors, (195), 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-03-17 12:12:33,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 198 transitions. [2025-03-17 12:12:33,371 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 198 transitions. Word has length 32 [2025-03-17 12:12:33,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:33,371 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 198 transitions. [2025-03-17 12:12:33,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.727272727272727) internal successors, (90), 34 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:33,372 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 198 transitions. [2025-03-17 12:12:33,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 12:12:33,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:33,372 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, 1, 1] [2025-03-17 12:12:33,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 12:12:33,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:12:33,576 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-17 12:12:33,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:33,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1046495099, now seen corresponding path program 1 times [2025-03-17 12:12:33,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:33,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80037049] [2025-03-17 12:12:33,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:33,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:33,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 12:12:33,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 12:12:33,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:33,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:34,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:34,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:34,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80037049] [2025-03-17 12:12:34,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80037049] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:12:34,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273822442] [2025-03-17 12:12:34,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:34,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:12:34,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:12:34,131 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:12:34,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 12:12:34,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 12:12:34,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 12:12:34,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:34,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:34,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-17 12:12:34,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:12:34,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:12:34,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:12:34,310 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:12:34,310 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-03-17 12:12:34,339 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 15 treesize of output 1 [2025-03-17 12:12:34,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:12:34,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 12:12:34,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-17 12:12:34,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:12:34,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:12:34,446 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:12:34,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:12:34,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:12:34,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:12:34,498 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 16 treesize of output 8 [2025-03-17 12:12:34,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:12:34,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:12:34,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:34,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:12:34,623 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1064 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1064) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 1)) is different from false [2025-03-17 12:12:36,840 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 12:12:36,840 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 13 treesize of output 12 [2025-03-17 12:12:44,866 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:12:44,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:44,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2025-03-17 12:12:44,873 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:12:44,874 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 36 treesize of output 24 [2025-03-17 12:12:44,875 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-03-17 12:12:52,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:52,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273822442] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:12:52,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:12:52,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 43 [2025-03-17 12:12:52,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970699042] [2025-03-17 12:12:52,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:12:52,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-17 12:12:52,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:52,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-17 12:12:52,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1410, Unknown=67, NotChecked=80, Total=1806 [2025-03-17 12:12:52,956 INFO L87 Difference]: Start difference. First operand 180 states and 198 transitions. Second operand has 43 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 43 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:53,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:53,799 INFO L93 Difference]: Finished difference Result 247 states and 273 transitions. [2025-03-17 12:12:53,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 12:12:53,800 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 43 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-17 12:12:53,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:53,801 INFO L225 Difference]: With dead ends: 247 [2025-03-17 12:12:53,801 INFO L226 Difference]: Without dead ends: 247 [2025-03-17 12:12:53,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=443, Invalid=2144, Unknown=69, NotChecked=100, Total=2756 [2025-03-17 12:12:53,803 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 465 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 1517 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 1736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:53,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 772 Invalid, 1736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1517 Invalid, 0 Unknown, 170 Unchecked, 0.6s Time] [2025-03-17 12:12:53,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-17 12:12:53,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 190. [2025-03-17 12:12:53,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 166 states have (on average 1.2409638554216869) internal successors, (206), 188 states have internal predecessors, (206), 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-03-17 12:12:53,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2025-03-17 12:12:53,807 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 34 [2025-03-17 12:12:53,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:53,807 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2025-03-17 12:12:53,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 43 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:53,807 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2025-03-17 12:12:53,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 12:12:53,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:53,808 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, 1, 1, 1, 1, 1] [2025-03-17 12:12:53,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 12:12:54,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:12:54,009 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-17 12:12:54,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:54,009 INFO L85 PathProgramCache]: Analyzing trace with hash 248999151, now seen corresponding path program 1 times [2025-03-17 12:12:54,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:54,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355264695] [2025-03-17 12:12:54,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:54,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:54,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 12:12:54,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 12:12:54,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:54,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:12:54,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:54,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355264695] [2025-03-17 12:12:54,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355264695] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:12:54,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164543812] [2025-03-17 12:12:54,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:54,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:12:54,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:12:54,201 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:12:54,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 12:12:54,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 12:12:54,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 12:12:54,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:54,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:54,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 12:12:54,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:12:54,303 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 12:12:54,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 20 treesize of output 27 [2025-03-17 12:12:54,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 16 treesize of output 29 [2025-03-17 12:12:54,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 37 [2025-03-17 12:12:54,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:12:54,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:12:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:12:54,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164543812] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:12:54,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:12:54,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-03-17 12:12:54,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528502430] [2025-03-17 12:12:54,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:12:54,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 12:12:54,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:54,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 12:12:54,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-17 12:12:54,694 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand has 14 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 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-03-17 12:12:54,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:54,931 INFO L93 Difference]: Finished difference Result 200 states and 218 transitions. [2025-03-17 12:12:54,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 12:12:54,932 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-17 12:12:54,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:54,932 INFO L225 Difference]: With dead ends: 200 [2025-03-17 12:12:54,932 INFO L226 Difference]: Without dead ends: 175 [2025-03-17 12:12:54,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-03-17 12:12:54,933 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 9 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:54,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 328 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:12:54,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-17 12:12:54,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-03-17 12:12:54,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 151 states have (on average 1.2582781456953642) internal successors, (190), 173 states have internal predecessors, (190), 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-03-17 12:12:54,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 193 transitions. [2025-03-17 12:12:54,936 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 193 transitions. Word has length 34 [2025-03-17 12:12:54,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:54,936 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 193 transitions. [2025-03-17 12:12:54,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 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-03-17 12:12:54,936 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 193 transitions. [2025-03-17 12:12:54,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 12:12:54,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:54,936 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:12:54,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 12:12:55,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-17 12:12:55,137 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-17 12:12:55,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:55,137 INFO L85 PathProgramCache]: Analyzing trace with hash 728970205, now seen corresponding path program 2 times [2025-03-17 12:12:55,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:55,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325488260] [2025-03-17 12:12:55,137 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:12:55,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:55,147 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-17 12:12:55,153 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 12:12:55,153 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:12:55,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:55,576 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:55,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:55,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325488260] [2025-03-17 12:12:55,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325488260] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:12:55,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313741991] [2025-03-17 12:12:55,576 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:12:55,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:12:55,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:12:55,578 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:12:55,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 12:12:55,647 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-17 12:12:55,670 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 12:12:55,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:12:55,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:55,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-17 12:12:55,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:12:55,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:12:55,746 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:12:55,747 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-03-17 12:12:55,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:12:55,783 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 15 treesize of output 1 [2025-03-17 12:12:55,873 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-17 12:12:55,873 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 27 treesize of output 22 [2025-03-17 12:12:55,887 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 19 treesize of output 18 [2025-03-17 12:12:55,942 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 12:12:55,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 58 [2025-03-17 12:12:55,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2025-03-17 12:12:56,197 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 12:12:56,197 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 21 [2025-03-17 12:12:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:12:56,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:12:56,591 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_~null~0#1.offset|)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4))) (and (forall ((v_ArrVal_1232 (Array Int Int)) (v_ArrVal_1231 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1231))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (< .cse0 0) (not (= v_ArrVal_1231 (store .cse1 .cse2 (select v_ArrVal_1231 .cse2)))) (= |c_ULTIMATE.start_main_~null~0#1.offset| (select (select .cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1232) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) .cse0)) (not (= v_ArrVal_1232 (store (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1232 |c_ULTIMATE.start_main_~end~0#1.offset|)) .cse2 (select v_ArrVal_1232 .cse2)))))))) (forall ((v_ArrVal_1232 (Array Int Int)) (v_ArrVal_1231 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1231) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse7 (select v_ArrVal_1232 |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (< .cse5 0) (not (= v_ArrVal_1231 (store .cse1 .cse2 (select v_ArrVal_1231 .cse2)))) (= (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1232))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) .cse5) .cse7) (not (= v_ArrVal_1232 (store (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| .cse7) .cse2 (select v_ArrVal_1232 .cse2))))))))) is different from false [2025-03-17 12:12:56,617 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base|) |c_ULTIMATE.start_main_#t~mem5#1.offset| |c_ULTIMATE.start_main_~null~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_#t~mem5#1.offset| 4))) (and (forall ((v_ArrVal_1232 (Array Int Int)) (v_ArrVal_1231 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1231) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse4 (select v_ArrVal_1232 |c_ULTIMATE.start_main_#t~mem5#1.offset|))) (or (< .cse0 0) (not (= (store .cse1 .cse2 (select v_ArrVal_1231 .cse2)) v_ArrVal_1231)) (not (= v_ArrVal_1232 (store (store .cse3 |c_ULTIMATE.start_main_#t~mem5#1.offset| .cse4) .cse2 (select v_ArrVal_1232 .cse2)))) (= (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1232))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) .cse0) .cse4)))) (forall ((v_ArrVal_1232 (Array Int Int)) (v_ArrVal_1231 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1231))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (< .cse6 0) (not (= (store .cse1 .cse2 (select v_ArrVal_1231 .cse2)) v_ArrVal_1231)) (= (select (select .cse7 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1232) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) .cse6) |c_ULTIMATE.start_main_~null~0#1.offset|) (not (= v_ArrVal_1232 (store (store .cse3 |c_ULTIMATE.start_main_#t~mem5#1.offset| (select v_ArrVal_1232 |c_ULTIMATE.start_main_#t~mem5#1.offset|)) .cse2 (select v_ArrVal_1232 .cse2)))))))))) is different from false [2025-03-17 12:12:56,646 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse5 (store (select |c_#memory_$Pointer$#1.offset| .cse7) .cse2 |c_ULTIMATE.start_main_~null~0#1.offset|)) (.cse4 (+ .cse2 4))) (and (forall ((v_ArrVal_1232 (Array Int Int)) (v_ArrVal_1231 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_1231) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse3 (select v_ArrVal_1232 .cse2))) (or (< .cse0 0) (not (= v_ArrVal_1232 (store (store .cse1 .cse2 .cse3) .cse4 (select v_ArrVal_1232 .cse4)))) (not (= v_ArrVal_1231 (store .cse5 .cse4 (select v_ArrVal_1231 .cse4)))) (= (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_1232))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) .cse0) .cse3)))) (forall ((v_ArrVal_1232 (Array Int Int)) (v_ArrVal_1231 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| .cse7 v_ArrVal_1231))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (= (select (select .cse8 (select (select (store |c_#memory_$Pointer$#1.base| .cse7 v_ArrVal_1232) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) .cse9) |c_ULTIMATE.start_main_~null~0#1.offset|) (< .cse9 0) (not (= v_ArrVal_1232 (store (store .cse1 .cse2 (select v_ArrVal_1232 .cse2)) .cse4 (select v_ArrVal_1232 .cse4)))) (not (= v_ArrVal_1231 (store .cse5 .cse4 (select v_ArrVal_1231 .cse4))))))))))) is different from false [2025-03-17 12:12:56,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:56,679 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 77 treesize of output 69 [2025-03-17 12:12:56,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:56,683 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 85 treesize of output 61 [2025-03-17 12:12:56,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:56,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 78 treesize of output 96 [2025-03-17 12:12:56,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:56,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 213 treesize of output 279 [2025-03-17 12:12:56,778 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 6 treesize of output 4 [2025-03-17 12:12:56,811 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 6 treesize of output 4 [2025-03-17 12:12:56,992 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-03-17 12:12:57,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:57,040 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 19 treesize of output 23 [2025-03-17 12:12:57,107 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-03-17 12:12:57,135 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-03-17 12:12:59,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:59,446 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 59 treesize of output 89 [2025-03-17 12:12:59,593 INFO L349 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2025-03-17 12:12:59,593 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 69 treesize of output 65 [2025-03-17 12:12:59,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:59,670 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 47 treesize of output 51 [2025-03-17 12:12:59,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:59,740 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 60 treesize of output 64 [2025-03-17 12:12:59,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:59,838 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 26 treesize of output 30 [2025-03-17 12:12:59,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:59,919 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 26 treesize of output 30 [2025-03-17 12:12:59,958 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 3 [2025-03-17 12:12:59,977 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 3 [2025-03-17 12:13:00,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:13:00,713 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 19 [2025-03-17 12:13:00,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:13:00,730 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 49 [2025-03-17 12:13:00,835 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 62 treesize of output 58 [2025-03-17 12:13:00,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 92 [2025-03-17 12:13:00,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:13:00,932 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 39 [2025-03-17 12:13:00,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:13:00,975 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 93 treesize of output 95 [2025-03-17 12:13:01,014 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 67 treesize of output 63 [2025-03-17 12:13:01,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:13:01,081 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 140 treesize of output 140 [2025-03-17 12:13:01,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:13:01,377 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 132 treesize of output 132 [2025-03-17 12:13:01,573 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 41 treesize of output 35 [2025-03-17 12:13:01,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:13:01,666 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 69 [2025-03-17 12:13:01,806 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 133 treesize of output 129 [2025-03-17 12:13:01,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:13:01,905 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 265 treesize of output 281 [2025-03-17 12:13:03,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:13:03,238 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 19 [2025-03-17 12:13:03,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:13:03,263 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 49 [2025-03-17 12:13:03,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:13:03,384 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 19 [2025-03-17 12:13:03,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 89 [2025-03-17 12:13:03,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:13:03,472 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 119 treesize of output 121 [2025-03-17 12:13:03,560 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 88 treesize of output 84 [2025-03-17 12:13:03,600 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 124 treesize of output 118 [2025-03-17 12:13:03,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:13:03,661 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 39 [2025-03-17 12:13:03,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:13:03,732 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 19 [2025-03-17 12:13:03,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:13:03,753 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 49 [2025-03-17 12:13:03,877 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 62 treesize of output 58 [2025-03-17 12:13:03,921 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 98 treesize of output 92 [2025-03-17 12:13:03,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:13:03,977 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 39 [2025-03-17 12:13:04,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:13:04,025 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 93 treesize of output 95 [2025-03-17 12:13:04,073 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 67 treesize of output 63 [2025-03-17 12:13:04,162 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 41 treesize of output 35 [2025-03-17 12:13:04,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:13:04,211 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 140 treesize of output 140 [2025-03-17 12:13:04,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:13:04,582 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 138 treesize of output 138 [2025-03-17 12:13:05,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:13:05,247 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 176 [2025-03-17 12:13:05,920 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 41 treesize of output 35 [2025-03-17 12:13:05,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:13:05,963 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 127 treesize of output 127 [2025-03-17 12:13:06,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:13:06,211 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 19 [2025-03-17 12:13:06,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:13:06,234 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 19 [2025-03-17 12:13:06,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:13:06,256 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 49 [2025-03-17 12:13:06,419 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:13:06,419 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 16 treesize of output 20 [2025-03-17 12:13:06,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:13:06,441 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 39 [2025-03-17 12:13:06,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 79 [2025-03-17 12:13:06,508 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 75 treesize of output 71 [2025-03-17 12:13:06,575 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 80 treesize of output 76 [2025-03-17 12:13:07,954 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 119 treesize of output 111 [2025-03-17 12:13:08,018 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 1134 treesize of output 1082 [2025-03-17 12:13:08,456 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 378 treesize of output 352 [2025-03-17 12:13:08,669 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 1420 treesize of output 1342 [2025-03-17 12:13:09,325 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 190 treesize of output 180 [2025-03-17 12:13:09,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 950 treesize of output 900 [2025-03-17 12:13:09,782 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 41 treesize of output 35 [2025-03-17 12:13:09,801 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 408 treesize of output 380 [2025-03-17 12:13:10,041 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 41 treesize of output 35 [2025-03-17 12:13:10,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 208 [2025-03-17 12:13:10,163 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 66 treesize of output 60 [2025-03-17 12:13:10,228 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 36 treesize of output 32 [2025-03-17 12:13:10,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2025-03-17 12:13:10,280 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 660 treesize of output 618 [2025-03-17 12:13:10,539 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 437 treesize of output 413 [2025-03-17 12:13:10,715 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 41 treesize of output 35 [2025-03-17 12:13:10,731 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 270 treesize of output 248 [2025-03-17 12:13:10,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2025-03-17 12:13:10,901 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 41 treesize of output 35 [2025-03-17 12:13:10,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-17 12:13:10,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2025-03-17 12:13:10,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-17 12:13:10,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-17 12:13:10,954 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 218 treesize of output 202 [2025-03-17 12:13:11,054 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 114 treesize of output 106 [2025-03-17 12:13:11,126 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 170 treesize of output 154 [2025-03-17 12:13:11,195 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 41 treesize of output 35 [2025-03-17 12:13:11,223 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 501 treesize of output 481 [2025-03-17 12:13:11,391 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 41 treesize of output 35 [2025-03-17 12:13:27,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:13:27,426 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 85191 treesize of output 81105 [2025-03-17 12:13:41,953 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:41,954 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:41,955 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:41,961 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:41,961 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:41,963 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:41,966 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:41,966 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:41,967 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:41,969 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:41,969 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:41,970 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:41,973 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:41,973 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:41,974 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,004 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,005 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,006 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,009 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,009 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,010 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,013 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,013 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,015 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,058 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,058 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,060 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,069 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,070 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,071 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,075 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,075 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,076 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,079 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,079 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,081 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,085 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,086 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,087 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,092 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,093 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,094 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,095 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,096 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,097 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,100 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,100 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,101 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,104 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,104 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,105 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,109 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,110 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,111 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,117 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,117 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,119 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,120 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,121 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,122 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,128 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,128 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,129 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,135 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,135 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,136 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,147 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,147 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,148 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,157 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,157 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,158 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,165 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,166 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,167 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,170 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,170 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,175 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,177 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,177 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,179 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,189 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,189 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,191 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,196 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,196 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,197 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,200 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,201 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,202 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,204 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,204 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,205 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,210 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,210 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,211 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,215 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,215 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,217 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,223 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,223 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,225 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,231 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,231 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,233 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,238 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,238 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,239 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,258 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,259 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,261 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,268 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,268 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,269 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,271 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,271 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,273 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,283 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,283 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,285 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,289 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,289 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,291 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,294 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,294 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,296 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,298 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,299 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,300 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,303 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,304 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,305 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,307 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,307 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,308 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,310 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,311 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,312 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,315 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,316 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,317 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,322 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,322 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,324 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,328 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,328 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,330 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,331 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,332 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,333 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,335 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,335 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,336 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,342 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,342 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,344 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,345 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,346 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,347 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,356 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,356 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,358 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,361 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,361 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,362 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,365 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,365 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,367 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,370 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,370 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,371 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,375 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,375 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,377 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,379 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,380 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,381 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,406 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,406 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,407 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,410 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,410 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,411 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,423 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,424 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,425 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,431 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,431 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,433 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,439 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,440 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,442 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,449 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,449 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,450 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,464 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,465 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,466 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,475 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,476 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,477 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,486 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,487 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,488 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,490 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,490 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,492 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,494 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,494 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,495 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,511 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,512 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,513 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,583 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,583 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,584 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:42,603 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,603 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:13:42,604 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:13:43,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:13:43,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 125 [2025-03-17 12:13:43,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:13:43,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 819 treesize of output 845 [2025-03-17 12:13:44,140 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 12:13:44,140 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 95 treesize of output 1 [2025-03-17 12:13:44,365 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:13:44,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313741991] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:13:44,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:13:44,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 42 [2025-03-17 12:13:44,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826684702] [2025-03-17 12:13:44,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:13:44,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-17 12:13:44,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:13:44,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-17 12:13:44,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1331, Unknown=16, NotChecked=228, Total=1722 [2025-03-17 12:13:44,371 INFO L87 Difference]: Start difference. First operand 175 states and 193 transitions. Second operand has 42 states, 42 states have (on average 2.4761904761904763) internal successors, (104), 42 states have internal predecessors, (104), 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-03-17 12:13:45,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:13:45,656 INFO L93 Difference]: Finished difference Result 215 states and 239 transitions. [2025-03-17 12:13:45,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 12:13:45,656 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.4761904761904763) internal successors, (104), 42 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-17 12:13:45,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:13:45,657 INFO L225 Difference]: With dead ends: 215 [2025-03-17 12:13:45,657 INFO L226 Difference]: Without dead ends: 215 [2025-03-17 12:13:45,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=364, Invalid=2602, Unknown=16, NotChecked=324, Total=3306 [2025-03-17 12:13:45,658 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 455 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 2048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 533 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 12:13:45,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 757 Invalid, 2048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1465 Invalid, 0 Unknown, 533 Unchecked, 0.7s Time] [2025-03-17 12:13:45,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-17 12:13:45,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 177. [2025-03-17 12:13:45,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 153 states have (on average 1.2549019607843137) internal successors, (192), 175 states have internal predecessors, (192), 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-03-17 12:13:45,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 195 transitions. [2025-03-17 12:13:45,661 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 195 transitions. Word has length 37 [2025-03-17 12:13:45,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:13:45,661 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 195 transitions. [2025-03-17 12:13:45,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.4761904761904763) internal successors, (104), 42 states have internal predecessors, (104), 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-03-17 12:13:45,661 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 195 transitions. [2025-03-17 12:13:45,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 12:13:45,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:13:45,662 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:13:45,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 12:13:45,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-17 12:13:45,862 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-17 12:13:45,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:13:45,863 INFO L85 PathProgramCache]: Analyzing trace with hash 193520631, now seen corresponding path program 1 times [2025-03-17 12:13:45,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:13:45,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199283885] [2025-03-17 12:13:45,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:13:45,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:13:45,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 12:13:45,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 12:13:45,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:13:45,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:13:46,389 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:13:46,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:13:46,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199283885] [2025-03-17 12:13:46,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199283885] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:13:46,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374128740] [2025-03-17 12:13:46,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:13:46,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:13:46,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:13:46,391 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:13:46,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 12:13:46,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 12:13:46,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 12:13:46,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:13:46,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:13:46,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-17 12:13:46,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:13:46,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:13:46,543 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:13:46,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:13:46,570 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 15 treesize of output 1 [2025-03-17 12:13:46,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:13:46,653 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:13:46,653 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 16 treesize of output 15 [2025-03-17 12:13:46,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:13:46,665 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-17 12:13:46,666 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 24 treesize of output 17 [2025-03-17 12:13:46,708 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 12:13:46,708 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 97 treesize of output 86 [2025-03-17 12:13:46,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 56 [2025-03-17 12:13:46,716 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 39 treesize of output 1 [2025-03-17 12:13:46,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-03-17 12:13:46,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-03-17 12:13:46,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-17 12:13:46,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:13:46,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:13:47,034 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 72 treesize of output 52 [2025-03-17 12:13:47,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:13:47,252 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 18 treesize of output 19 [2025-03-17 12:13:47,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:13:47,260 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 30 treesize of output 29 [2025-03-17 12:13:47,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-03-17 12:13:47,283 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 12:13:47,283 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 18 treesize of output 1 [2025-03-17 12:13:47,438 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:13:47,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374128740] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:13:47,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:13:47,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 13] total 38 [2025-03-17 12:13:47,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569226938] [2025-03-17 12:13:47,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:13:47,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-17 12:13:47,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:13:47,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-17 12:13:47,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1301, Unknown=2, NotChecked=0, Total=1406 [2025-03-17 12:13:47,439 INFO L87 Difference]: Start difference. First operand 177 states and 195 transitions. Second operand has 38 states, 38 states have (on average 2.5526315789473686) internal successors, (97), 38 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:48,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:13:48,847 INFO L93 Difference]: Finished difference Result 196 states and 215 transitions. [2025-03-17 12:13:48,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 12:13:48,848 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.5526315789473686) internal successors, (97), 38 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-17 12:13:48,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:13:48,848 INFO L225 Difference]: With dead ends: 196 [2025-03-17 12:13:48,848 INFO L226 Difference]: Without dead ends: 196 [2025-03-17 12:13:48,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=385, Invalid=2693, Unknown=2, NotChecked=0, Total=3080 [2025-03-17 12:13:48,849 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 439 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 1956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 12:13:48,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 968 Invalid, 1956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 12:13:48,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-17 12:13:48,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 176. [2025-03-17 12:13:48,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 152 states have (on average 1.25) internal successors, (190), 174 states have internal predecessors, (190), 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-03-17 12:13:48,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 193 transitions. [2025-03-17 12:13:48,852 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 193 transitions. Word has length 39 [2025-03-17 12:13:48,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:13:48,852 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 193 transitions. [2025-03-17 12:13:48,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.5526315789473686) internal successors, (97), 38 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:13:48,852 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 193 transitions. [2025-03-17 12:13:48,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 12:13:48,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:13:48,853 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:13:48,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 12:13:49,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-17 12:13:49,054 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 55 more)] === [2025-03-17 12:13:49,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:13:49,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1275895380, now seen corresponding path program 1 times [2025-03-17 12:13:49,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:13:49,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643185630] [2025-03-17 12:13:49,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:13:49,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:13:49,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 12:13:49,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 12:13:49,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:13:49,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:13:49,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:13:49,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:13:49,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643185630] [2025-03-17 12:13:49,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643185630] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:13:49,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465203907] [2025-03-17 12:13:49,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:13:49,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:13:49,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:13:49,443 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:13:49,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 12:13:49,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 12:13:49,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 12:13:49,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:13:49,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:13:49,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-17 12:13:49,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:13:49,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:13:49,600 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 12:13:49,600 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