./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-01-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:33:31,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:33:31,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:33:31,898 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:33:31,898 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:33:31,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:33:31,926 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:33:31,926 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:33:31,926 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:33:31,926 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:33:31,926 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:33:31,926 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:33:31,927 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:33:31,927 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:33:31,927 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:33:31,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:33:31,927 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:33:31,927 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:33:31,927 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:33:31,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:33:31,927 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:33:31,927 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:33:31,929 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:33:31,929 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:33:31,929 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:33:31,929 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:33:31,930 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:33:31,930 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:33:31,930 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:33:31,930 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:33:31,930 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:33:31,930 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:33:31,930 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:33:31,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:33:31,930 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:33:31,930 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:33:31,930 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:33:31,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:33:31,930 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:33:31,930 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:33:31,931 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:33:31,931 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:33:31,931 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d [2025-02-06 10:33:32,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:33:32,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:33:32,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:33:32,242 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:33:32,243 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:33:32,244 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-1.i [2025-02-06 10:33:33,515 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a357e839d/7a8df00864cc48e18afa3ecdbda4cb02/FLAG563d0b284 [2025-02-06 10:33:33,826 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:33:33,827 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i [2025-02-06 10:33:33,840 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a357e839d/7a8df00864cc48e18afa3ecdbda4cb02/FLAG563d0b284 [2025-02-06 10:33:34,078 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a357e839d/7a8df00864cc48e18afa3ecdbda4cb02 [2025-02-06 10:33:34,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:33:34,082 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:33:34,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:33:34,083 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:33:34,087 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:33:34,088 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:33:34" (1/1) ... [2025-02-06 10:33:34,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cbe30a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:34, skipping insertion in model container [2025-02-06 10:33:34,089 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:33:34" (1/1) ... [2025-02-06 10:33:34,120 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:33:34,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:33:34,430 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:33:34,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:33:34,508 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:33:34,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:34 WrapperNode [2025-02-06 10:33:34,509 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:33:34,510 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:33:34,510 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:33:34,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:33:34,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:34" (1/1) ... [2025-02-06 10:33:34,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:34" (1/1) ... [2025-02-06 10:33:34,551 INFO L138 Inliner]: procedures = 119, calls = 54, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 207 [2025-02-06 10:33:34,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:33:34,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:33:34,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:33:34,552 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:33:34,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:34" (1/1) ... [2025-02-06 10:33:34,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:34" (1/1) ... [2025-02-06 10:33:34,569 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:34" (1/1) ... [2025-02-06 10:33:34,599 INFO L175 MemorySlicer]: Split 31 memory accesses to 2 slices as follows [2, 29]. 94 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-02-06 10:33:34,602 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:34" (1/1) ... [2025-02-06 10:33:34,603 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:34" (1/1) ... [2025-02-06 10:33:34,611 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:34" (1/1) ... [2025-02-06 10:33:34,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:34" (1/1) ... [2025-02-06 10:33:34,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:34" (1/1) ... [2025-02-06 10:33:34,615 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:34" (1/1) ... [2025-02-06 10:33:34,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:33:34,618 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:33:34,619 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:33:34,619 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:33:34,620 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:34" (1/1) ... [2025-02-06 10:33:34,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:33:34,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:33:34,647 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:33:34,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:33:34,667 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-06 10:33:34,667 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-06 10:33:34,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:33:34,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:33:34,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:33:34,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:33:34,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:33:34,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:33:34,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:33:34,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:33:34,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:33:34,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:33:34,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:33:34,763 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:33:34,765 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:33:35,288 INFO L? ?]: Removed 141 outVars from TransFormulas that were not future-live. [2025-02-06 10:33:35,288 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:33:35,310 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:33:35,312 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:33:35,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:33:35 BoogieIcfgContainer [2025-02-06 10:33:35,312 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:33:35,315 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:33:35,315 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:33:35,319 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:33:35,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:33:34" (1/3) ... [2025-02-06 10:33:35,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d4e8fc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:33:35, skipping insertion in model container [2025-02-06 10:33:35,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:34" (2/3) ... [2025-02-06 10:33:35,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d4e8fc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:33:35, skipping insertion in model container [2025-02-06 10:33:35,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:33:35" (3/3) ... [2025-02-06 10:33:35,323 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2025-02-06 10:33:35,339 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:33:35,341 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-01-1.i that has 2 procedures, 207 locations, 1 initial locations, 17 loop locations, and 66 error locations. [2025-02-06 10:33:35,381 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:33:35,395 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;@1bff25d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:33:35,395 INFO L334 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2025-02-06 10:33:35,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 207 states, 126 states have (on average 1.9285714285714286) internal successors, (243), 192 states have internal predecessors, (243), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 10:33:35,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 10:33:35,406 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:35,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 10:33:35,407 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:35,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:35,413 INFO L85 PathProgramCache]: Analyzing trace with hash 284958, now seen corresponding path program 1 times [2025-02-06 10:33:35,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:35,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459815077] [2025-02-06 10:33:35,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:35,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:35,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 10:33:35,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 10:33:35,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:35,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:35,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:35,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:35,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459815077] [2025-02-06 10:33:35,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459815077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:35,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:35,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:33:35,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690305186] [2025-02-06 10:33:35,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:35,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:33:35,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:35,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:33:35,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:33:35,661 INFO L87 Difference]: Start difference. First operand has 207 states, 126 states have (on average 1.9285714285714286) internal successors, (243), 192 states have internal predecessors, (243), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:35,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:35,879 INFO L93 Difference]: Finished difference Result 187 states and 211 transitions. [2025-02-06 10:33:35,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:33:35,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2025-02-06 10:33:35,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:35,888 INFO L225 Difference]: With dead ends: 187 [2025-02-06 10:33:35,889 INFO L226 Difference]: Without dead ends: 185 [2025-02-06 10:33:35,891 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-02-06 10:33:35,894 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 167 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:35,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 136 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:33:35,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-02-06 10:33:35,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-02-06 10:33:35,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 114 states have (on average 1.719298245614035) internal successors, (196), 183 states have internal predecessors, (196), 13 states have call successors, (13), 1 states have call predecessors, (13), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:35,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 209 transitions. [2025-02-06 10:33:35,937 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 209 transitions. Word has length 3 [2025-02-06 10:33:35,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:35,938 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 209 transitions. [2025-02-06 10:33:35,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:35,938 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 209 transitions. [2025-02-06 10:33:35,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 10:33:35,938 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:35,938 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 10:33:35,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:33:35,939 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:35,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:35,939 INFO L85 PathProgramCache]: Analyzing trace with hash 284959, now seen corresponding path program 1 times [2025-02-06 10:33:35,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:35,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875318609] [2025-02-06 10:33:35,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:35,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:35,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 10:33:35,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 10:33:35,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:35,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:36,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:36,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:36,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875318609] [2025-02-06 10:33:36,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875318609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:36,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:36,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:33:36,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716844973] [2025-02-06 10:33:36,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:36,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:33:36,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:36,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:33:36,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:33:36,043 INFO L87 Difference]: Start difference. First operand 185 states and 209 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:36,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:36,190 INFO L93 Difference]: Finished difference Result 208 states and 236 transitions. [2025-02-06 10:33:36,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:33:36,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2025-02-06 10:33:36,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:36,192 INFO L225 Difference]: With dead ends: 208 [2025-02-06 10:33:36,192 INFO L226 Difference]: Without dead ends: 208 [2025-02-06 10:33:36,192 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-02-06 10:33:36,193 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 165 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:36,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 163 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:36,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-02-06 10:33:36,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 198. [2025-02-06 10:33:36,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 134 states have (on average 1.6417910447761195) internal successors, (220), 196 states have internal predecessors, (220), 13 states have call successors, (13), 1 states have call predecessors, (13), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:36,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 233 transitions. [2025-02-06 10:33:36,211 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 233 transitions. Word has length 3 [2025-02-06 10:33:36,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:36,212 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 233 transitions. [2025-02-06 10:33:36,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:36,212 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 233 transitions. [2025-02-06 10:33:36,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:33:36,212 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:36,212 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:36,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:33:36,213 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:36,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:36,214 INFO L85 PathProgramCache]: Analyzing trace with hash -2121387106, now seen corresponding path program 1 times [2025-02-06 10:33:36,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:36,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839336295] [2025-02-06 10:33:36,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:36,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:36,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:33:36,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:33:36,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:36,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:36,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:36,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:36,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839336295] [2025-02-06 10:33:36,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839336295] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:36,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:36,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:33:36,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874946763] [2025-02-06 10:33:36,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:36,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:33:36,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:36,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:33:36,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:33:36,271 INFO L87 Difference]: Start difference. First operand 198 states and 233 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-02-06 10:33:36,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:36,317 INFO L93 Difference]: Finished difference Result 209 states and 236 transitions. [2025-02-06 10:33:36,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:33:36,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2025-02-06 10:33:36,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:36,320 INFO L225 Difference]: With dead ends: 209 [2025-02-06 10:33:36,320 INFO L226 Difference]: Without dead ends: 209 [2025-02-06 10:33:36,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:33:36,320 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 167 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:36,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 223 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:33:36,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-02-06 10:33:36,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 197. [2025-02-06 10:33:36,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 134 states have (on average 1.626865671641791) internal successors, (218), 195 states have internal predecessors, (218), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:36,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 230 transitions. [2025-02-06 10:33:36,335 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 230 transitions. Word has length 8 [2025-02-06 10:33:36,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:36,336 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 230 transitions. [2025-02-06 10:33:36,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-02-06 10:33:36,336 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 230 transitions. [2025-02-06 10:33:36,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:33:36,336 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:36,336 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:36,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:33:36,338 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:36,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:36,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1301065334, now seen corresponding path program 1 times [2025-02-06 10:33:36,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:36,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834051352] [2025-02-06 10:33:36,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:36,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:36,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:33:36,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:33:36,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:36,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:36,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:36,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:36,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834051352] [2025-02-06 10:33:36,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834051352] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:36,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:36,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:33:36,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558272602] [2025-02-06 10:33:36,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:36,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:33:36,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:36,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:33:36,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:33:36,541 INFO L87 Difference]: Start difference. First operand 197 states and 230 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:36,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:36,714 INFO L93 Difference]: Finished difference Result 196 states and 229 transitions. [2025-02-06 10:33:36,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:33:36,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2025-02-06 10:33:36,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:36,716 INFO L225 Difference]: With dead ends: 196 [2025-02-06 10:33:36,716 INFO L226 Difference]: Without dead ends: 196 [2025-02-06 10:33:36,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:33:36,717 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 2 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:36,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 574 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:36,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-02-06 10:33:36,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-02-06 10:33:36,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 134 states have (on average 1.6194029850746268) internal successors, (217), 194 states have internal predecessors, (217), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:36,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 229 transitions. [2025-02-06 10:33:36,731 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 229 transitions. Word has length 12 [2025-02-06 10:33:36,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:36,732 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 229 transitions. [2025-02-06 10:33:36,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:36,732 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 229 transitions. [2025-02-06 10:33:36,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:33:36,732 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:36,732 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:36,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:33:36,733 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:36,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:36,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1301065335, now seen corresponding path program 1 times [2025-02-06 10:33:36,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:36,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872928613] [2025-02-06 10:33:36,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:36,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:36,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:33:36,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:33:36,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:36,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:36,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:36,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:36,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872928613] [2025-02-06 10:33:36,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872928613] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:36,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:36,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:33:36,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388199049] [2025-02-06 10:33:36,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:36,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:33:36,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:36,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:33:36,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:33:36,985 INFO L87 Difference]: Start difference. First operand 196 states and 229 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:37,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:37,158 INFO L93 Difference]: Finished difference Result 195 states and 228 transitions. [2025-02-06 10:33:37,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:33:37,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2025-02-06 10:33:37,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:37,160 INFO L225 Difference]: With dead ends: 195 [2025-02-06 10:33:37,160 INFO L226 Difference]: Without dead ends: 195 [2025-02-06 10:33:37,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:33:37,161 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 1 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:37,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 585 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:37,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-02-06 10:33:37,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2025-02-06 10:33:37,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 134 states have (on average 1.6119402985074627) internal successors, (216), 193 states have internal predecessors, (216), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:37,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 228 transitions. [2025-02-06 10:33:37,173 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 228 transitions. Word has length 12 [2025-02-06 10:33:37,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:37,174 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 228 transitions. [2025-02-06 10:33:37,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:37,174 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 228 transitions. [2025-02-06 10:33:37,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 10:33:37,174 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:37,175 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:37,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:33:37,175 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:37,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:37,177 INFO L85 PathProgramCache]: Analyzing trace with hash -2042280719, now seen corresponding path program 1 times [2025-02-06 10:33:37,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:37,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842484115] [2025-02-06 10:33:37,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:37,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:37,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 10:33:37,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 10:33:37,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:37,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:37,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:37,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:37,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842484115] [2025-02-06 10:33:37,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842484115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:37,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:37,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:33:37,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555904062] [2025-02-06 10:33:37,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:37,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:33:37,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:37,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:33:37,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:33:37,433 INFO L87 Difference]: Start difference. First operand 195 states and 228 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:37,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:37,822 INFO L93 Difference]: Finished difference Result 194 states and 227 transitions. [2025-02-06 10:33:37,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:33:37,822 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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 15 [2025-02-06 10:33:37,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:37,823 INFO L225 Difference]: With dead ends: 194 [2025-02-06 10:33:37,823 INFO L226 Difference]: Without dead ends: 194 [2025-02-06 10:33:37,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:33:37,824 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 162 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:37,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 676 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:33:37,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-02-06 10:33:37,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-02-06 10:33:37,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 134 states have (on average 1.6044776119402986) internal successors, (215), 192 states have internal predecessors, (215), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:37,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 227 transitions. [2025-02-06 10:33:37,836 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 227 transitions. Word has length 15 [2025-02-06 10:33:37,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:37,836 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 227 transitions. [2025-02-06 10:33:37,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:37,836 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 227 transitions. [2025-02-06 10:33:37,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 10:33:37,836 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:37,837 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:37,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:33:37,837 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:37,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:37,837 INFO L85 PathProgramCache]: Analyzing trace with hash -2042280718, now seen corresponding path program 1 times [2025-02-06 10:33:37,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:37,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957725561] [2025-02-06 10:33:37,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:37,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:37,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 10:33:37,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 10:33:37,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:37,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:38,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:38,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:38,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957725561] [2025-02-06 10:33:38,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957725561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:38,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:38,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:33:38,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670678196] [2025-02-06 10:33:38,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:38,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:33:38,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:38,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:33:38,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:33:38,179 INFO L87 Difference]: Start difference. First operand 194 states and 227 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:38,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:38,501 INFO L93 Difference]: Finished difference Result 193 states and 226 transitions. [2025-02-06 10:33:38,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:33:38,502 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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 15 [2025-02-06 10:33:38,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:38,503 INFO L225 Difference]: With dead ends: 193 [2025-02-06 10:33:38,503 INFO L226 Difference]: Without dead ends: 193 [2025-02-06 10:33:38,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:33:38,504 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 161 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:38,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 448 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:33:38,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-02-06 10:33:38,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-02-06 10:33:38,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 134 states have (on average 1.5970149253731343) internal successors, (214), 191 states have internal predecessors, (214), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:38,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 226 transitions. [2025-02-06 10:33:38,512 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 226 transitions. Word has length 15 [2025-02-06 10:33:38,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:38,513 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 226 transitions. [2025-02-06 10:33:38,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:38,513 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 226 transitions. [2025-02-06 10:33:38,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 10:33:38,514 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:38,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:38,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:33:38,514 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:38,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:38,515 INFO L85 PathProgramCache]: Analyzing trace with hash -2011178758, now seen corresponding path program 1 times [2025-02-06 10:33:38,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:38,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453108210] [2025-02-06 10:33:38,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:38,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:38,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 10:33:38,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 10:33:38,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:38,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:38,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:38,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:38,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453108210] [2025-02-06 10:33:38,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453108210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:38,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:38,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:33:38,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457719889] [2025-02-06 10:33:38,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:38,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:33:38,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:38,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:33:38,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:33:38,551 INFO L87 Difference]: Start difference. First operand 193 states and 226 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-02-06 10:33:38,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:38,570 INFO L93 Difference]: Finished difference Result 194 states and 227 transitions. [2025-02-06 10:33:38,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:33:38,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-02-06 10:33:38,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:38,572 INFO L225 Difference]: With dead ends: 194 [2025-02-06 10:33:38,572 INFO L226 Difference]: Without dead ends: 194 [2025-02-06 10:33:38,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:33:38,573 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:38,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 372 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:33:38,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-02-06 10:33:38,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-02-06 10:33:38,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 135 states have (on average 1.5925925925925926) internal successors, (215), 192 states have internal predecessors, (215), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:38,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 227 transitions. [2025-02-06 10:33:38,580 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 227 transitions. Word has length 17 [2025-02-06 10:33:38,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:38,581 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 227 transitions. [2025-02-06 10:33:38,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-02-06 10:33:38,582 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 227 transitions. [2025-02-06 10:33:38,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:33:38,582 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:38,582 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:38,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:33:38,582 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:38,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:38,583 INFO L85 PathProgramCache]: Analyzing trace with hash 905740922, now seen corresponding path program 1 times [2025-02-06 10:33:38,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:38,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380600531] [2025-02-06 10:33:38,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:38,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:38,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:33:38,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:33:38,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:38,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:38,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:38,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:38,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380600531] [2025-02-06 10:33:38,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380600531] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:38,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:38,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:33:38,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791077826] [2025-02-06 10:33:38,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:38,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:33:38,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:38,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:33:38,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:33:38,716 INFO L87 Difference]: Start difference. First operand 194 states and 227 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-02-06 10:33:38,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:38,955 INFO L93 Difference]: Finished difference Result 279 states and 326 transitions. [2025-02-06 10:33:38,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:33:38,956 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 19 [2025-02-06 10:33:38,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:38,957 INFO L225 Difference]: With dead ends: 279 [2025-02-06 10:33:38,957 INFO L226 Difference]: Without dead ends: 279 [2025-02-06 10:33:38,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:33:38,958 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 90 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:38,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 895 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:33:38,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-02-06 10:33:38,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 192. [2025-02-06 10:33:38,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 134 states have (on average 1.5895522388059702) internal successors, (213), 190 states have internal predecessors, (213), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:38,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 224 transitions. [2025-02-06 10:33:38,964 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 224 transitions. Word has length 19 [2025-02-06 10:33:38,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:38,964 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 224 transitions. [2025-02-06 10:33:38,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-02-06 10:33:38,965 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 224 transitions. [2025-02-06 10:33:38,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:33:38,965 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:38,965 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:38,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:33:38,965 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:38,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:38,966 INFO L85 PathProgramCache]: Analyzing trace with hash -43859193, now seen corresponding path program 1 times [2025-02-06 10:33:38,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:38,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054520181] [2025-02-06 10:33:38,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:38,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:38,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:33:38,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:33:38,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:38,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:39,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:39,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:39,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054520181] [2025-02-06 10:33:39,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054520181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:39,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:39,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:33:39,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121099792] [2025-02-06 10:33:39,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:39,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:33:39,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:39,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:33:39,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:33:39,097 INFO L87 Difference]: Start difference. First operand 192 states and 224 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:39,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:39,237 INFO L93 Difference]: Finished difference Result 280 states and 326 transitions. [2025-02-06 10:33:39,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:33:39,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2025-02-06 10:33:39,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:39,242 INFO L225 Difference]: With dead ends: 280 [2025-02-06 10:33:39,242 INFO L226 Difference]: Without dead ends: 280 [2025-02-06 10:33:39,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:33:39,243 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 89 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:39,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 637 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:39,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-02-06 10:33:39,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 196. [2025-02-06 10:33:39,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 138 states have (on average 1.5724637681159421) internal successors, (217), 194 states have internal predecessors, (217), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:39,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 228 transitions. [2025-02-06 10:33:39,253 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 228 transitions. Word has length 19 [2025-02-06 10:33:39,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:39,253 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 228 transitions. [2025-02-06 10:33:39,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:39,254 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 228 transitions. [2025-02-06 10:33:39,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 10:33:39,255 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:39,255 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] [2025-02-06 10:33:39,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 10:33:39,256 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:39,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:39,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1497691001, now seen corresponding path program 1 times [2025-02-06 10:33:39,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:39,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186609494] [2025-02-06 10:33:39,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:39,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:39,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 10:33:39,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 10:33:39,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:39,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:39,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:39,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:39,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186609494] [2025-02-06 10:33:39,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186609494] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:39,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:39,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:33:39,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249583810] [2025-02-06 10:33:39,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:39,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:33:39,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:39,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:33:39,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:33:39,348 INFO L87 Difference]: Start difference. First operand 196 states and 228 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:39,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:39,508 INFO L93 Difference]: Finished difference Result 187 states and 219 transitions. [2025-02-06 10:33:39,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:33:39,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2025-02-06 10:33:39,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:39,510 INFO L225 Difference]: With dead ends: 187 [2025-02-06 10:33:39,510 INFO L226 Difference]: Without dead ends: 187 [2025-02-06 10:33:39,510 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-02-06 10:33:39,511 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 223 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:39,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 132 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:39,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-02-06 10:33:39,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2025-02-06 10:33:39,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 140 states have (on average 1.4857142857142858) internal successors, (208), 185 states have internal predecessors, (208), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:39,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 219 transitions. [2025-02-06 10:33:39,517 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 219 transitions. Word has length 21 [2025-02-06 10:33:39,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:39,519 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 219 transitions. [2025-02-06 10:33:39,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:39,519 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 219 transitions. [2025-02-06 10:33:39,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 10:33:39,520 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:39,520 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] [2025-02-06 10:33:39,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 10:33:39,521 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:39,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:39,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1497691000, now seen corresponding path program 1 times [2025-02-06 10:33:39,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:39,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467841398] [2025-02-06 10:33:39,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:39,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:39,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 10:33:39,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 10:33:39,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:39,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:39,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:39,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:39,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467841398] [2025-02-06 10:33:39,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467841398] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:39,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:39,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:33:39,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120295309] [2025-02-06 10:33:39,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:39,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:33:39,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:39,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:33:39,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:33:39,652 INFO L87 Difference]: Start difference. First operand 187 states and 219 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:39,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:39,843 INFO L93 Difference]: Finished difference Result 231 states and 264 transitions. [2025-02-06 10:33:39,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:33:39,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2025-02-06 10:33:39,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:39,845 INFO L225 Difference]: With dead ends: 231 [2025-02-06 10:33:39,845 INFO L226 Difference]: Without dead ends: 231 [2025-02-06 10:33:39,845 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-02-06 10:33:39,846 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 214 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:39,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 221 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:33:39,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-02-06 10:33:39,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 212. [2025-02-06 10:33:39,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 165 states have (on average 1.4848484848484849) internal successors, (245), 210 states have internal predecessors, (245), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:39,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 256 transitions. [2025-02-06 10:33:39,852 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 256 transitions. Word has length 21 [2025-02-06 10:33:39,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:39,853 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 256 transitions. [2025-02-06 10:33:39,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:39,853 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 256 transitions. [2025-02-06 10:33:39,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 10:33:39,853 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:39,854 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] [2025-02-06 10:33:39,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 10:33:39,854 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:39,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:39,854 INFO L85 PathProgramCache]: Analyzing trace with hash 348767053, now seen corresponding path program 1 times [2025-02-06 10:33:39,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:39,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739831621] [2025-02-06 10:33:39,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:39,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:39,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:33:39,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:33:39,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:39,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:39,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:39,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:39,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739831621] [2025-02-06 10:33:39,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739831621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:39,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:39,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:33:39,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12379835] [2025-02-06 10:33:39,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:39,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:33:39,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:39,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:33:39,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:33:39,900 INFO L87 Difference]: Start difference. First operand 212 states and 256 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-02-06 10:33:40,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:40,002 INFO L93 Difference]: Finished difference Result 232 states and 264 transitions. [2025-02-06 10:33:40,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:33:40,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 26 [2025-02-06 10:33:40,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:40,003 INFO L225 Difference]: With dead ends: 232 [2025-02-06 10:33:40,003 INFO L226 Difference]: Without dead ends: 232 [2025-02-06 10:33:40,003 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-02-06 10:33:40,004 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 213 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:40,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 302 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:40,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-06 10:33:40,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 211. [2025-02-06 10:33:40,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 165 states have (on average 1.4727272727272727) internal successors, (243), 209 states have internal predecessors, (243), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:40,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 253 transitions. [2025-02-06 10:33:40,010 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 253 transitions. Word has length 26 [2025-02-06 10:33:40,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:40,010 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 253 transitions. [2025-02-06 10:33:40,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-02-06 10:33:40,010 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 253 transitions. [2025-02-06 10:33:40,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 10:33:40,011 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:40,011 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] [2025-02-06 10:33:40,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 10:33:40,011 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:40,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:40,012 INFO L85 PathProgramCache]: Analyzing trace with hash -2112913983, now seen corresponding path program 1 times [2025-02-06 10:33:40,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:40,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065849202] [2025-02-06 10:33:40,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:40,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:40,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 10:33:40,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 10:33:40,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:40,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:40,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:40,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:40,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065849202] [2025-02-06 10:33:40,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065849202] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:40,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:40,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:33:40,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500779772] [2025-02-06 10:33:40,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:40,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:33:40,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:40,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:33:40,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:33:40,122 INFO L87 Difference]: Start difference. First operand 211 states and 253 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:40,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:40,366 INFO L93 Difference]: Finished difference Result 211 states and 253 transitions. [2025-02-06 10:33:40,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:33:40,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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 25 [2025-02-06 10:33:40,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:40,368 INFO L225 Difference]: With dead ends: 211 [2025-02-06 10:33:40,368 INFO L226 Difference]: Without dead ends: 211 [2025-02-06 10:33:40,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:33:40,369 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 80 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:40,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 462 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:33:40,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-02-06 10:33:40,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 210. [2025-02-06 10:33:40,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 165 states have (on average 1.4666666666666666) internal successors, (242), 208 states have internal predecessors, (242), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:40,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 252 transitions. [2025-02-06 10:33:40,378 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 252 transitions. Word has length 25 [2025-02-06 10:33:40,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:40,378 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 252 transitions. [2025-02-06 10:33:40,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:40,378 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 252 transitions. [2025-02-06 10:33:40,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 10:33:40,378 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:40,379 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] [2025-02-06 10:33:40,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 10:33:40,379 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:40,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:40,382 INFO L85 PathProgramCache]: Analyzing trace with hash -2112913982, now seen corresponding path program 1 times [2025-02-06 10:33:40,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:40,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754646955] [2025-02-06 10:33:40,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:40,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:40,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 10:33:40,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 10:33:40,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:40,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:40,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:40,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:40,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754646955] [2025-02-06 10:33:40,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754646955] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:40,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:40,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:33:40,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775658549] [2025-02-06 10:33:40,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:40,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:33:40,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:40,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:33:40,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:33:40,528 INFO L87 Difference]: Start difference. First operand 210 states and 252 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:40,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:40,744 INFO L93 Difference]: Finished difference Result 202 states and 244 transitions. [2025-02-06 10:33:40,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:33:40,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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 25 [2025-02-06 10:33:40,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:40,746 INFO L225 Difference]: With dead ends: 202 [2025-02-06 10:33:40,746 INFO L226 Difference]: Without dead ends: 202 [2025-02-06 10:33:40,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:33:40,748 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 38 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:40,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 546 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:33:40,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-06 10:33:40,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 196. [2025-02-06 10:33:40,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 160 states have (on average 1.41875) internal successors, (227), 194 states have internal predecessors, (227), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:40,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 237 transitions. [2025-02-06 10:33:40,753 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 237 transitions. Word has length 25 [2025-02-06 10:33:40,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:40,754 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 237 transitions. [2025-02-06 10:33:40,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:40,754 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 237 transitions. [2025-02-06 10:33:40,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 10:33:40,755 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:40,755 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-02-06 10:33:40,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 10:33:40,756 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:40,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:40,756 INFO L85 PathProgramCache]: Analyzing trace with hash 253904471, now seen corresponding path program 1 times [2025-02-06 10:33:40,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:40,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745092388] [2025-02-06 10:33:40,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:40,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:40,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 10:33:40,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:33:40,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:40,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:40,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:40,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:40,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745092388] [2025-02-06 10:33:40,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745092388] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:40,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:40,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:33:40,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674980535] [2025-02-06 10:33:40,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:40,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:33:40,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:40,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:33:40,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:33:40,846 INFO L87 Difference]: Start difference. First operand 196 states and 237 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-02-06 10:33:40,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:40,960 INFO L93 Difference]: Finished difference Result 200 states and 240 transitions. [2025-02-06 10:33:40,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:33:40,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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 30 [2025-02-06 10:33:40,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:40,961 INFO L225 Difference]: With dead ends: 200 [2025-02-06 10:33:40,962 INFO L226 Difference]: Without dead ends: 200 [2025-02-06 10:33:40,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:33:40,962 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 36 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:40,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 660 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:40,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-06 10:33:40,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 194. [2025-02-06 10:33:40,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 160 states have (on average 1.40625) internal successors, (225), 192 states have internal predecessors, (225), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:40,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 233 transitions. [2025-02-06 10:33:40,967 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 233 transitions. Word has length 30 [2025-02-06 10:33:40,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:40,967 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 233 transitions. [2025-02-06 10:33:40,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-02-06 10:33:40,967 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 233 transitions. [2025-02-06 10:33:40,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-06 10:33:40,967 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:40,967 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] [2025-02-06 10:33:40,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 10:33:40,967 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:40,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:40,968 INFO L85 PathProgramCache]: Analyzing trace with hash -693318151, now seen corresponding path program 1 times [2025-02-06 10:33:40,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:40,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341604897] [2025-02-06 10:33:40,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:40,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:40,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 10:33:40,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 10:33:40,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:40,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:40,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:40,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:40,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341604897] [2025-02-06 10:33:40,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341604897] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:40,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:40,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:33:40,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852670138] [2025-02-06 10:33:40,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:40,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:33:40,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:40,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:33:40,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:33:40,995 INFO L87 Difference]: Start difference. First operand 194 states and 233 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-02-06 10:33:41,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:41,005 INFO L93 Difference]: Finished difference Result 208 states and 249 transitions. [2025-02-06 10:33:41,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:33:41,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 33 [2025-02-06 10:33:41,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:41,007 INFO L225 Difference]: With dead ends: 208 [2025-02-06 10:33:41,007 INFO L226 Difference]: Without dead ends: 208 [2025-02-06 10:33:41,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:33:41,007 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 7 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:41,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 309 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:33:41,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-02-06 10:33:41,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 202. [2025-02-06 10:33:41,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 168 states have (on average 1.3988095238095237) internal successors, (235), 200 states have internal predecessors, (235), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:41,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 243 transitions. [2025-02-06 10:33:41,012 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 243 transitions. Word has length 33 [2025-02-06 10:33:41,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:41,012 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 243 transitions. [2025-02-06 10:33:41,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-02-06 10:33:41,012 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 243 transitions. [2025-02-06 10:33:41,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-06 10:33:41,012 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:41,013 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-02-06 10:33:41,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 10:33:41,013 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:41,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:41,013 INFO L85 PathProgramCache]: Analyzing trace with hash 153827570, now seen corresponding path program 1 times [2025-02-06 10:33:41,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:41,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841093076] [2025-02-06 10:33:41,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:41,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:41,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 10:33:41,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 10:33:41,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:41,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:41,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:41,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:41,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841093076] [2025-02-06 10:33:41,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841093076] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:41,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:41,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:33:41,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162634220] [2025-02-06 10:33:41,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:41,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:33:41,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:41,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:33:41,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:33:41,044 INFO L87 Difference]: Start difference. First operand 202 states and 243 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-02-06 10:33:41,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:41,064 INFO L93 Difference]: Finished difference Result 201 states and 240 transitions. [2025-02-06 10:33:41,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:33:41,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-02-06 10:33:41,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:41,065 INFO L225 Difference]: With dead ends: 201 [2025-02-06 10:33:41,065 INFO L226 Difference]: Without dead ends: 201 [2025-02-06 10:33:41,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:33:41,066 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 13 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:41,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 280 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:33:41,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-06 10:33:41,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-02-06 10:33:41,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 168 states have (on average 1.3869047619047619) internal successors, (233), 199 states have internal predecessors, (233), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:41,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 240 transitions. [2025-02-06 10:33:41,070 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 240 transitions. Word has length 34 [2025-02-06 10:33:41,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:41,070 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 240 transitions. [2025-02-06 10:33:41,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-02-06 10:33:41,071 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 240 transitions. [2025-02-06 10:33:41,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-06 10:33:41,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:41,071 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-02-06 10:33:41,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 10:33:41,071 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:41,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:41,072 INFO L85 PathProgramCache]: Analyzing trace with hash 153697031, now seen corresponding path program 1 times [2025-02-06 10:33:41,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:41,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389541930] [2025-02-06 10:33:41,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:41,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:41,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 10:33:41,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 10:33:41,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:41,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:41,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:41,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:41,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389541930] [2025-02-06 10:33:41,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389541930] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:41,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:41,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:33:41,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820630356] [2025-02-06 10:33:41,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:41,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 10:33:41,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:41,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 10:33:41,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:33:41,301 INFO L87 Difference]: Start difference. First operand 201 states and 240 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:41,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:41,620 INFO L93 Difference]: Finished difference Result 324 states and 374 transitions. [2025-02-06 10:33:41,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:33:41,621 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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-02-06 10:33:41,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:41,622 INFO L225 Difference]: With dead ends: 324 [2025-02-06 10:33:41,622 INFO L226 Difference]: Without dead ends: 324 [2025-02-06 10:33:41,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:33:41,623 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 423 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:41,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 816 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:33:41,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-02-06 10:33:41,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 238. [2025-02-06 10:33:41,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 205 states have (on average 1.3414634146341464) internal successors, (275), 236 states have internal predecessors, (275), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:41,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 282 transitions. [2025-02-06 10:33:41,629 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 282 transitions. Word has length 34 [2025-02-06 10:33:41,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:41,630 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 282 transitions. [2025-02-06 10:33:41,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:41,630 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 282 transitions. [2025-02-06 10:33:41,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 10:33:41,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:41,631 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, 1] [2025-02-06 10:33:41,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 10:33:41,631 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:41,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:41,632 INFO L85 PathProgramCache]: Analyzing trace with hash -711190447, now seen corresponding path program 1 times [2025-02-06 10:33:41,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:41,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722119908] [2025-02-06 10:33:41,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:41,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:41,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 10:33:41,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 10:33:41,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:41,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:41,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:41,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:41,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722119908] [2025-02-06 10:33:41,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722119908] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:33:41,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818254133] [2025-02-06 10:33:41,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:41,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:33:41,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:33:41,797 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:33:41,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 10:33:41,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 10:33:41,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 10:33:41,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:41,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:41,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 10:33:41,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:33:41,931 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-02-06 10:33:41,938 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-02-06 10:33:41,994 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-02-06 10:33:42,002 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-02-06 10:33:42,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:42,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:33:42,769 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-02-06 10:33:42,775 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-02-06 10:33:42,786 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-02-06 10:33:42,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:33:42,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:42,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818254133] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:33:42,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:33:42,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2025-02-06 10:33:42,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446284923] [2025-02-06 10:33:42,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:33:42,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 10:33:42,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:42,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 10:33:42,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:33:42,808 INFO L87 Difference]: Start difference. First operand 238 states and 282 transitions. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:43,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:43,193 INFO L93 Difference]: Finished difference Result 329 states and 379 transitions. [2025-02-06 10:33:43,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:33:43,193 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-02-06 10:33:43,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:43,195 INFO L225 Difference]: With dead ends: 329 [2025-02-06 10:33:43,195 INFO L226 Difference]: Without dead ends: 329 [2025-02-06 10:33:43,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-02-06 10:33:43,195 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 463 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:43,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 806 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:33:43,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-02-06 10:33:43,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 280. [2025-02-06 10:33:43,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 247 states have (on average 1.3360323886639676) internal successors, (330), 278 states have internal predecessors, (330), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:43,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 337 transitions. [2025-02-06 10:33:43,202 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 337 transitions. Word has length 35 [2025-02-06 10:33:43,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:43,202 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 337 transitions. [2025-02-06 10:33:43,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:43,202 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 337 transitions. [2025-02-06 10:33:43,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-06 10:33:43,203 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:43,203 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, 1, 1, 1] [2025-02-06 10:33:43,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 10:33:43,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:33:43,407 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:43,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:43,408 INFO L85 PathProgramCache]: Analyzing trace with hash 881462804, now seen corresponding path program 1 times [2025-02-06 10:33:43,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:43,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670651796] [2025-02-06 10:33:43,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:43,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:43,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 10:33:43,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 10:33:43,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:43,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:43,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:43,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:43,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670651796] [2025-02-06 10:33:43,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670651796] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:43,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:43,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:33:43,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898572923] [2025-02-06 10:33:43,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:43,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:33:43,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:43,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:33:43,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:33:43,505 INFO L87 Difference]: Start difference. First operand 280 states and 337 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:43,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:43,636 INFO L93 Difference]: Finished difference Result 279 states and 336 transitions. [2025-02-06 10:33:43,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:33:43,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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-02-06 10:33:43,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:43,638 INFO L225 Difference]: With dead ends: 279 [2025-02-06 10:33:43,638 INFO L226 Difference]: Without dead ends: 279 [2025-02-06 10:33:43,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:33:43,639 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 2 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:43,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 464 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:43,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-02-06 10:33:43,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2025-02-06 10:33:43,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 247 states have (on average 1.3319838056680162) internal successors, (329), 277 states have internal predecessors, (329), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:43,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 336 transitions. [2025-02-06 10:33:43,645 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 336 transitions. Word has length 37 [2025-02-06 10:33:43,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:43,645 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 336 transitions. [2025-02-06 10:33:43,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:43,645 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 336 transitions. [2025-02-06 10:33:43,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-06 10:33:43,646 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:43,646 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, 1, 1, 1] [2025-02-06 10:33:43,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 10:33:43,646 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:43,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:43,646 INFO L85 PathProgramCache]: Analyzing trace with hash 881462805, now seen corresponding path program 1 times [2025-02-06 10:33:43,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:43,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241728965] [2025-02-06 10:33:43,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:43,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:43,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 10:33:43,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 10:33:43,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:43,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:43,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:43,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:43,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241728965] [2025-02-06 10:33:43,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241728965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:43,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:43,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:33:43,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250875832] [2025-02-06 10:33:43,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:43,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:33:43,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:43,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:33:43,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:33:43,810 INFO L87 Difference]: Start difference. First operand 279 states and 336 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:43,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:43,948 INFO L93 Difference]: Finished difference Result 278 states and 335 transitions. [2025-02-06 10:33:43,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:33:43,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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-02-06 10:33:43,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:43,950 INFO L225 Difference]: With dead ends: 278 [2025-02-06 10:33:43,950 INFO L226 Difference]: Without dead ends: 278 [2025-02-06 10:33:43,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:33:43,952 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:43,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 467 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:43,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-02-06 10:33:43,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2025-02-06 10:33:43,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 247 states have (on average 1.3279352226720649) internal successors, (328), 276 states have internal predecessors, (328), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:43,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 335 transitions. [2025-02-06 10:33:43,958 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 335 transitions. Word has length 37 [2025-02-06 10:33:43,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:43,958 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 335 transitions. [2025-02-06 10:33:43,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:43,958 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 335 transitions. [2025-02-06 10:33:43,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 10:33:43,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:43,959 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, 1, 1, 1, 1, 1] [2025-02-06 10:33:43,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 10:33:43,959 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:43,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:43,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1767040051, now seen corresponding path program 1 times [2025-02-06 10:33:43,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:43,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328511679] [2025-02-06 10:33:43,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:43,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:43,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 10:33:43,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:33:43,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:43,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:44,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:44,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:44,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328511679] [2025-02-06 10:33:44,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328511679] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:44,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:44,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 10:33:44,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644730341] [2025-02-06 10:33:44,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:44,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:33:44,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:44,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:33:44,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:33:44,199 INFO L87 Difference]: Start difference. First operand 278 states and 335 transitions. Second operand has 11 states, 10 states have (on average 3.9) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:44,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:44,811 INFO L93 Difference]: Finished difference Result 344 states and 399 transitions. [2025-02-06 10:33:44,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:33:44,811 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 11 states have internal predecessors, (39), 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 39 [2025-02-06 10:33:44,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:44,813 INFO L225 Difference]: With dead ends: 344 [2025-02-06 10:33:44,813 INFO L226 Difference]: Without dead ends: 344 [2025-02-06 10:33:44,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-02-06 10:33:44,814 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 304 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:44,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1046 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 10:33:44,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-02-06 10:33:44,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 281. [2025-02-06 10:33:44,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 252 states have (on average 1.3015873015873016) internal successors, (328), 279 states have internal predecessors, (328), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:44,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 335 transitions. [2025-02-06 10:33:44,822 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 335 transitions. Word has length 39 [2025-02-06 10:33:44,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:44,822 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 335 transitions. [2025-02-06 10:33:44,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 11 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:44,822 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 335 transitions. [2025-02-06 10:33:44,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 10:33:44,823 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:44,823 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, 1, 1, 1, 1, 1] [2025-02-06 10:33:44,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 10:33:44,823 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:44,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:44,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1767040050, now seen corresponding path program 1 times [2025-02-06 10:33:44,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:44,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383870512] [2025-02-06 10:33:44,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:44,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:44,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 10:33:44,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:33:44,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:44,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:45,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:45,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:45,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383870512] [2025-02-06 10:33:45,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383870512] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:45,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:45,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 10:33:45,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470599369] [2025-02-06 10:33:45,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:45,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 10:33:45,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:45,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 10:33:45,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:33:45,265 INFO L87 Difference]: Start difference. First operand 281 states and 335 transitions. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:45,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:45,862 INFO L93 Difference]: Finished difference Result 367 states and 418 transitions. [2025-02-06 10:33:45,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:33:45,863 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 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 39 [2025-02-06 10:33:45,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:45,864 INFO L225 Difference]: With dead ends: 367 [2025-02-06 10:33:45,864 INFO L226 Difference]: Without dead ends: 367 [2025-02-06 10:33:45,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-02-06 10:33:45,865 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 324 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:45,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1029 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:33:45,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-02-06 10:33:45,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 288. [2025-02-06 10:33:45,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 259 states have (on average 1.2972972972972974) internal successors, (336), 286 states have internal predecessors, (336), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:45,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 343 transitions. [2025-02-06 10:33:45,871 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 343 transitions. Word has length 39 [2025-02-06 10:33:45,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:45,871 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 343 transitions. [2025-02-06 10:33:45,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:45,872 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 343 transitions. [2025-02-06 10:33:45,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-06 10:33:45,872 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:45,872 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, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:45,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 10:33:45,872 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:45,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:45,873 INFO L85 PathProgramCache]: Analyzing trace with hash 228471239, now seen corresponding path program 1 times [2025-02-06 10:33:45,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:45,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933232918] [2025-02-06 10:33:45,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:45,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:45,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 10:33:45,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 10:33:45,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:45,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:46,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:46,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:46,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933232918] [2025-02-06 10:33:46,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933232918] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:46,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:46,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 10:33:46,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686860159] [2025-02-06 10:33:46,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:46,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:33:46,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:46,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:33:46,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:33:46,147 INFO L87 Difference]: Start difference. First operand 288 states and 343 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:46,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:46,514 INFO L93 Difference]: Finished difference Result 288 states and 343 transitions. [2025-02-06 10:33:46,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 10:33:46,514 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 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 40 [2025-02-06 10:33:46,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:46,516 INFO L225 Difference]: With dead ends: 288 [2025-02-06 10:33:46,516 INFO L226 Difference]: Without dead ends: 288 [2025-02-06 10:33:46,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-02-06 10:33:46,517 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 69 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:46,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 797 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:33:46,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-02-06 10:33:46,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 287. [2025-02-06 10:33:46,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 259 states have (on average 1.2934362934362935) internal successors, (335), 285 states have internal predecessors, (335), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:46,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 342 transitions. [2025-02-06 10:33:46,529 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 342 transitions. Word has length 40 [2025-02-06 10:33:46,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:46,529 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 342 transitions. [2025-02-06 10:33:46,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:46,529 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 342 transitions. [2025-02-06 10:33:46,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-06 10:33:46,529 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:46,529 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, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:46,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 10:33:46,530 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:46,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:46,530 INFO L85 PathProgramCache]: Analyzing trace with hash 228471240, now seen corresponding path program 1 times [2025-02-06 10:33:46,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:46,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258820129] [2025-02-06 10:33:46,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:46,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:46,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 10:33:46,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 10:33:46,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:46,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:46,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:46,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:46,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258820129] [2025-02-06 10:33:46,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258820129] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:46,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:46,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 10:33:46,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685754714] [2025-02-06 10:33:46,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:46,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:33:46,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:46,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:33:46,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:33:46,859 INFO L87 Difference]: Start difference. First operand 287 states and 342 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:47,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:47,262 INFO L93 Difference]: Finished difference Result 287 states and 342 transitions. [2025-02-06 10:33:47,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 10:33:47,263 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 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 40 [2025-02-06 10:33:47,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:47,264 INFO L225 Difference]: With dead ends: 287 [2025-02-06 10:33:47,264 INFO L226 Difference]: Without dead ends: 287 [2025-02-06 10:33:47,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-02-06 10:33:47,265 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 65 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:47,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 814 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:33:47,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-02-06 10:33:47,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 286. [2025-02-06 10:33:47,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 259 states have (on average 1.2895752895752897) internal successors, (334), 284 states have internal predecessors, (334), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:47,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 341 transitions. [2025-02-06 10:33:47,273 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 341 transitions. Word has length 40 [2025-02-06 10:33:47,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:47,273 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 341 transitions. [2025-02-06 10:33:47,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:47,273 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 341 transitions. [2025-02-06 10:33:47,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:33:47,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:47,274 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:47,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 10:33:47,274 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:47,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:47,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1661866218, now seen corresponding path program 1 times [2025-02-06 10:33:47,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:47,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655569797] [2025-02-06 10:33:47,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:47,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:47,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:33:47,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:33:47,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:47,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:47,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:47,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:47,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655569797] [2025-02-06 10:33:47,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655569797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:47,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:47,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:33:47,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635270823] [2025-02-06 10:33:47,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:47,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:33:47,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:47,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:33:47,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:33:47,310 INFO L87 Difference]: Start difference. First operand 286 states and 341 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-02-06 10:33:47,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:47,320 INFO L93 Difference]: Finished difference Result 288 states and 343 transitions. [2025-02-06 10:33:47,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:33:47,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 42 [2025-02-06 10:33:47,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:47,321 INFO L225 Difference]: With dead ends: 288 [2025-02-06 10:33:47,321 INFO L226 Difference]: Without dead ends: 288 [2025-02-06 10:33:47,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:33:47,322 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:47,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:33:47,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-02-06 10:33:47,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2025-02-06 10:33:47,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 261 states have (on average 1.2873563218390804) internal successors, (336), 286 states have internal predecessors, (336), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:47,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 343 transitions. [2025-02-06 10:33:47,329 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 343 transitions. Word has length 42 [2025-02-06 10:33:47,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:47,329 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 343 transitions. [2025-02-06 10:33:47,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-02-06 10:33:47,329 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 343 transitions. [2025-02-06 10:33:47,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-06 10:33:47,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:47,330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:47,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 10:33:47,330 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:47,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:47,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1057915990, now seen corresponding path program 1 times [2025-02-06 10:33:47,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:47,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276005674] [2025-02-06 10:33:47,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:47,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:47,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 10:33:47,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 10:33:47,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:47,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:47,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:33:47,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:47,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276005674] [2025-02-06 10:33:47,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276005674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:47,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:47,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:33:47,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849389578] [2025-02-06 10:33:47,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:47,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:33:47,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:47,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:33:47,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:33:47,446 INFO L87 Difference]: Start difference. First operand 288 states and 343 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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-02-06 10:33:47,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:47,645 INFO L93 Difference]: Finished difference Result 301 states and 356 transitions. [2025-02-06 10:33:47,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:33:47,645 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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 43 [2025-02-06 10:33:47,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:47,646 INFO L225 Difference]: With dead ends: 301 [2025-02-06 10:33:47,647 INFO L226 Difference]: Without dead ends: 301 [2025-02-06 10:33:47,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:33:47,648 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 10 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:47,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 691 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:33:47,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-02-06 10:33:47,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 298. [2025-02-06 10:33:47,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 271 states have (on average 1.2767527675276753) internal successors, (346), 296 states have internal predecessors, (346), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:47,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 353 transitions. [2025-02-06 10:33:47,659 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 353 transitions. Word has length 43 [2025-02-06 10:33:47,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:47,659 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 353 transitions. [2025-02-06 10:33:47,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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-02-06 10:33:47,659 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 353 transitions. [2025-02-06 10:33:47,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:33:47,659 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:47,659 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:47,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 10:33:47,660 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:47,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:47,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1351125916, now seen corresponding path program 1 times [2025-02-06 10:33:47,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:47,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843621116] [2025-02-06 10:33:47,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:47,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:47,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:33:47,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:33:47,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:47,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:47,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:33:47,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:47,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843621116] [2025-02-06 10:33:47,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843621116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:47,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:47,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:33:47,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129461199] [2025-02-06 10:33:47,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:47,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:33:47,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:47,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:33:47,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:33:47,697 INFO L87 Difference]: Start difference. First operand 298 states and 353 transitions. Second operand has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:47,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:47,738 INFO L93 Difference]: Finished difference Result 307 states and 357 transitions. [2025-02-06 10:33:47,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:33:47,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 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 42 [2025-02-06 10:33:47,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:47,740 INFO L225 Difference]: With dead ends: 307 [2025-02-06 10:33:47,740 INFO L226 Difference]: Without dead ends: 307 [2025-02-06 10:33:47,740 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-02-06 10:33:47,744 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 94 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:47,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 161 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:33:47,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-02-06 10:33:47,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 299. [2025-02-06 10:33:47,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 272 states have (on average 1.275735294117647) internal successors, (347), 297 states have internal predecessors, (347), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:47,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 354 transitions. [2025-02-06 10:33:47,751 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 354 transitions. Word has length 42 [2025-02-06 10:33:47,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:47,751 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 354 transitions. [2025-02-06 10:33:47,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:47,752 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 354 transitions. [2025-02-06 10:33:47,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-06 10:33:47,752 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:47,752 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:47,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 10:33:47,752 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:47,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:47,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1085050, now seen corresponding path program 1 times [2025-02-06 10:33:47,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:47,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657804063] [2025-02-06 10:33:47,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:47,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:47,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 10:33:47,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 10:33:47,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:47,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:48,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:48,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:48,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657804063] [2025-02-06 10:33:48,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657804063] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:48,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:48,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 10:33:48,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023219536] [2025-02-06 10:33:48,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:48,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 10:33:48,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:48,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 10:33:48,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:33:48,299 INFO L87 Difference]: Start difference. First operand 299 states and 354 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 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-02-06 10:33:48,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:48,991 INFO L93 Difference]: Finished difference Result 373 states and 423 transitions. [2025-02-06 10:33:48,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 10:33:48,992 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 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 43 [2025-02-06 10:33:48,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:48,993 INFO L225 Difference]: With dead ends: 373 [2025-02-06 10:33:48,993 INFO L226 Difference]: Without dead ends: 373 [2025-02-06 10:33:48,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2025-02-06 10:33:48,994 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 541 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:48,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 1131 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:33:48,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-02-06 10:33:48,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 299. [2025-02-06 10:33:48,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 272 states have (on average 1.2720588235294117) internal successors, (346), 297 states have internal predecessors, (346), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:49,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 353 transitions. [2025-02-06 10:33:49,000 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 353 transitions. Word has length 43 [2025-02-06 10:33:49,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:49,000 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 353 transitions. [2025-02-06 10:33:49,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 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-02-06 10:33:49,001 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 353 transitions. [2025-02-06 10:33:49,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 10:33:49,001 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:49,001 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:49,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 10:33:49,002 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:49,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:49,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1520726422, now seen corresponding path program 1 times [2025-02-06 10:33:49,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:49,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809079629] [2025-02-06 10:33:49,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:49,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:49,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 10:33:49,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 10:33:49,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:49,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:49,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:49,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:49,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809079629] [2025-02-06 10:33:49,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809079629] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:49,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:49,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:33:49,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072531127] [2025-02-06 10:33:49,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:49,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:33:49,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:49,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:33:49,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:33:49,108 INFO L87 Difference]: Start difference. First operand 299 states and 353 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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-02-06 10:33:49,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:49,285 INFO L93 Difference]: Finished difference Result 310 states and 364 transitions. [2025-02-06 10:33:49,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:33:49,286 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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 44 [2025-02-06 10:33:49,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:49,287 INFO L225 Difference]: With dead ends: 310 [2025-02-06 10:33:49,287 INFO L226 Difference]: Without dead ends: 310 [2025-02-06 10:33:49,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:33:49,288 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 12 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:49,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 722 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:49,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-02-06 10:33:49,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 296. [2025-02-06 10:33:49,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 270 states have (on average 1.2666666666666666) internal successors, (342), 294 states have internal predecessors, (342), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:49,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 348 transitions. [2025-02-06 10:33:49,294 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 348 transitions. Word has length 44 [2025-02-06 10:33:49,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:49,294 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 348 transitions. [2025-02-06 10:33:49,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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-02-06 10:33:49,295 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 348 transitions. [2025-02-06 10:33:49,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-06 10:33:49,295 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:49,295 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:49,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 10:33:49,296 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:49,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:49,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1041355444, now seen corresponding path program 1 times [2025-02-06 10:33:49,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:49,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179808557] [2025-02-06 10:33:49,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:49,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:49,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 10:33:49,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 10:33:49,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:49,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:49,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:33:49,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:49,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179808557] [2025-02-06 10:33:49,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179808557] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:33:49,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688739116] [2025-02-06 10:33:49,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:49,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:33:49,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:33:49,368 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:33:49,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 10:33:49,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 10:33:49,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 10:33:49,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:49,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:49,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 10:33:49,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:33:49,539 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 13 treesize of output 9 [2025-02-06 10:33:49,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:33:49,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:33:49,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:33:49,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688739116] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:33:49,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:33:49,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-02-06 10:33:49,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390324925] [2025-02-06 10:33:49,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:33:49,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:33:49,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:49,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:33:49,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:33:49,613 INFO L87 Difference]: Start difference. First operand 296 states and 348 transitions. Second operand has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:49,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:49,766 INFO L93 Difference]: Finished difference Result 363 states and 420 transitions. [2025-02-06 10:33:49,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:33:49,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 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 45 [2025-02-06 10:33:49,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:49,768 INFO L225 Difference]: With dead ends: 363 [2025-02-06 10:33:49,768 INFO L226 Difference]: Without dead ends: 362 [2025-02-06 10:33:49,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:33:49,768 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 35 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:49,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 489 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:49,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-02-06 10:33:49,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 327. [2025-02-06 10:33:49,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 301 states have (on average 1.2425249169435215) internal successors, (374), 325 states have internal predecessors, (374), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:49,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 380 transitions. [2025-02-06 10:33:49,777 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 380 transitions. Word has length 45 [2025-02-06 10:33:49,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:49,777 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 380 transitions. [2025-02-06 10:33:49,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:49,777 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 380 transitions. [2025-02-06 10:33:49,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-06 10:33:49,778 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:49,778 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:49,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 10:33:49,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:33:49,979 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:49,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:49,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1041353748, now seen corresponding path program 1 times [2025-02-06 10:33:49,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:49,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156926652] [2025-02-06 10:33:49,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:49,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:49,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 10:33:49,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 10:33:49,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:49,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:50,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:50,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:50,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156926652] [2025-02-06 10:33:50,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156926652] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:33:50,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859117386] [2025-02-06 10:33:50,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:50,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:33:50,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:33:50,173 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:33:50,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 10:33:50,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 10:33:50,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 10:33:50,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:50,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:50,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 10:33:50,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:33:50,274 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-02-06 10:33:50,278 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-02-06 10:33:50,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-06 10:33:50,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-06 10:33:50,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:33:50,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:33:50,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:33:50,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859117386] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:33:50,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:33:50,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 9 [2025-02-06 10:33:50,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709754777] [2025-02-06 10:33:50,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:33:50,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 10:33:50,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:50,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 10:33:50,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:33:50,553 INFO L87 Difference]: Start difference. First operand 327 states and 380 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:50,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:50,905 INFO L93 Difference]: Finished difference Result 409 states and 468 transitions. [2025-02-06 10:33:50,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:33:50,905 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 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 45 [2025-02-06 10:33:50,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:50,907 INFO L225 Difference]: With dead ends: 409 [2025-02-06 10:33:50,907 INFO L226 Difference]: Without dead ends: 385 [2025-02-06 10:33:50,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:33:50,907 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 135 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:50,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 922 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:33:50,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-02-06 10:33:50,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 330. [2025-02-06 10:33:50,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 304 states have (on average 1.2730263157894737) internal successors, (387), 328 states have internal predecessors, (387), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:50,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 393 transitions. [2025-02-06 10:33:50,916 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 393 transitions. Word has length 45 [2025-02-06 10:33:50,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:50,917 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 393 transitions. [2025-02-06 10:33:50,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:50,917 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 393 transitions. [2025-02-06 10:33:50,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 10:33:50,918 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:50,919 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:50,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 10:33:51,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:33:51,119 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:51,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:51,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1321755644, now seen corresponding path program 1 times [2025-02-06 10:33:51,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:51,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251695981] [2025-02-06 10:33:51,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:51,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:51,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 10:33:51,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 10:33:51,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:51,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:51,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:51,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:51,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251695981] [2025-02-06 10:33:51,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251695981] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:51,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:51,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 10:33:51,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946474768] [2025-02-06 10:33:51,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:51,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 10:33:51,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:51,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 10:33:51,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:33:51,660 INFO L87 Difference]: Start difference. First operand 330 states and 393 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 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-02-06 10:33:52,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:52,306 INFO L93 Difference]: Finished difference Result 369 states and 432 transitions. [2025-02-06 10:33:52,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 10:33:52,307 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 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 47 [2025-02-06 10:33:52,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:52,308 INFO L225 Difference]: With dead ends: 369 [2025-02-06 10:33:52,308 INFO L226 Difference]: Without dead ends: 369 [2025-02-06 10:33:52,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2025-02-06 10:33:52,309 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 352 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:52,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1043 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:33:52,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-02-06 10:33:52,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 330. [2025-02-06 10:33:52,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 304 states have (on average 1.269736842105263) internal successors, (386), 328 states have internal predecessors, (386), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:52,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 392 transitions. [2025-02-06 10:33:52,315 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 392 transitions. Word has length 47 [2025-02-06 10:33:52,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:52,315 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 392 transitions. [2025-02-06 10:33:52,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 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-02-06 10:33:52,316 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 392 transitions. [2025-02-06 10:33:52,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 10:33:52,316 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:52,317 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:52,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-06 10:33:52,317 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:52,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:52,317 INFO L85 PathProgramCache]: Analyzing trace with hash -359196252, now seen corresponding path program 1 times [2025-02-06 10:33:52,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:52,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861689669] [2025-02-06 10:33:52,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:52,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:52,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 10:33:52,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 10:33:52,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:52,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:52,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:33:52,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:52,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861689669] [2025-02-06 10:33:52,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861689669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:52,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:52,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:33:52,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326849822] [2025-02-06 10:33:52,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:52,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:33:52,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:52,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:33:52,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:33:52,352 INFO L87 Difference]: Start difference. First operand 330 states and 392 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-02-06 10:33:52,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:52,403 INFO L93 Difference]: Finished difference Result 332 states and 391 transitions. [2025-02-06 10:33:52,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:33:52,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 48 [2025-02-06 10:33:52,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:52,404 INFO L225 Difference]: With dead ends: 332 [2025-02-06 10:33:52,404 INFO L226 Difference]: Without dead ends: 332 [2025-02-06 10:33:52,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:33:52,405 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 74 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:52,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 182 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:33:52,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-02-06 10:33:52,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 329. [2025-02-06 10:33:52,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 304 states have (on average 1.2598684210526316) internal successors, (383), 327 states have internal predecessors, (383), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:52,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 388 transitions. [2025-02-06 10:33:52,410 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 388 transitions. Word has length 48 [2025-02-06 10:33:52,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:52,411 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 388 transitions. [2025-02-06 10:33:52,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-02-06 10:33:52,411 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 388 transitions. [2025-02-06 10:33:52,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 10:33:52,411 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:52,412 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:52,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-06 10:33:52,412 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:52,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:52,412 INFO L85 PathProgramCache]: Analyzing trace with hash -359371732, now seen corresponding path program 1 times [2025-02-06 10:33:52,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:52,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764677232] [2025-02-06 10:33:52,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:52,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:52,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 10:33:52,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 10:33:52,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:52,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:52,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:33:52,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:52,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764677232] [2025-02-06 10:33:52,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764677232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:52,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:52,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:33:52,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762025115] [2025-02-06 10:33:52,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:52,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:33:52,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:52,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:33:52,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:33:52,620 INFO L87 Difference]: Start difference. First operand 329 states and 388 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:52,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:52,991 INFO L93 Difference]: Finished difference Result 365 states and 423 transitions. [2025-02-06 10:33:52,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:33:52,992 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 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 48 [2025-02-06 10:33:52,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:52,993 INFO L225 Difference]: With dead ends: 365 [2025-02-06 10:33:52,993 INFO L226 Difference]: Without dead ends: 365 [2025-02-06 10:33:52,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-02-06 10:33:52,994 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 437 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:52,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 548 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:33:52,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-02-06 10:33:53,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 338. [2025-02-06 10:33:53,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 313 states have (on average 1.2587859424920127) internal successors, (394), 336 states have internal predecessors, (394), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:53,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 399 transitions. [2025-02-06 10:33:53,002 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 399 transitions. Word has length 48 [2025-02-06 10:33:53,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:53,003 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 399 transitions. [2025-02-06 10:33:53,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:53,003 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 399 transitions. [2025-02-06 10:33:53,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 10:33:53,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:53,003 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:53,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-06 10:33:53,004 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:53,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:53,004 INFO L85 PathProgramCache]: Analyzing trace with hash -359371731, now seen corresponding path program 1 times [2025-02-06 10:33:53,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:53,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833375357] [2025-02-06 10:33:53,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:53,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:53,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 10:33:53,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 10:33:53,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:53,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:53,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:33:53,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:53,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833375357] [2025-02-06 10:33:53,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833375357] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:53,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:53,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:33:53,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466955441] [2025-02-06 10:33:53,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:53,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:33:53,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:53,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:33:53,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:33:53,292 INFO L87 Difference]: Start difference. First operand 338 states and 399 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:53,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:53,627 INFO L93 Difference]: Finished difference Result 363 states and 422 transitions. [2025-02-06 10:33:53,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:33:53,628 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 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 48 [2025-02-06 10:33:53,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:53,629 INFO L225 Difference]: With dead ends: 363 [2025-02-06 10:33:53,629 INFO L226 Difference]: Without dead ends: 363 [2025-02-06 10:33:53,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-02-06 10:33:53,629 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 320 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:53,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 578 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:33:53,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-02-06 10:33:53,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 345. [2025-02-06 10:33:53,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 320 states have (on average 1.25625) internal successors, (402), 343 states have internal predecessors, (402), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:53,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 407 transitions. [2025-02-06 10:33:53,636 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 407 transitions. Word has length 48 [2025-02-06 10:33:53,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:53,636 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 407 transitions. [2025-02-06 10:33:53,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:53,636 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 407 transitions. [2025-02-06 10:33:53,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 10:33:53,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:53,637 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:53,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-06 10:33:53,637 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:53,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:53,638 INFO L85 PathProgramCache]: Analyzing trace with hash 413414598, now seen corresponding path program 1 times [2025-02-06 10:33:53,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:53,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608745225] [2025-02-06 10:33:53,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:53,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:53,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 10:33:53,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 10:33:53,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:53,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:33:53,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:53,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608745225] [2025-02-06 10:33:53,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608745225] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:53,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:53,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:33:53,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179150032] [2025-02-06 10:33:53,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:53,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:33:53,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:53,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:33:53,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:33:53,744 INFO L87 Difference]: Start difference. First operand 345 states and 407 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:53,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:53,950 INFO L93 Difference]: Finished difference Result 363 states and 421 transitions. [2025-02-06 10:33:53,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:33:53,951 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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 50 [2025-02-06 10:33:53,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:53,952 INFO L225 Difference]: With dead ends: 363 [2025-02-06 10:33:53,952 INFO L226 Difference]: Without dead ends: 363 [2025-02-06 10:33:53,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:33:53,952 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 213 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:53,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 468 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:33:53,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-02-06 10:33:53,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 345. [2025-02-06 10:33:53,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 320 states have (on average 1.253125) internal successors, (401), 343 states have internal predecessors, (401), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:53,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 406 transitions. [2025-02-06 10:33:53,959 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 406 transitions. Word has length 50 [2025-02-06 10:33:53,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:53,959 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 406 transitions. [2025-02-06 10:33:53,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:53,959 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 406 transitions. [2025-02-06 10:33:53,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-06 10:33:53,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:53,960 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:53,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-06 10:33:53,960 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:53,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:53,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1962041766, now seen corresponding path program 1 times [2025-02-06 10:33:53,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:53,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200707585] [2025-02-06 10:33:53,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:53,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:53,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 10:33:53,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 10:33:53,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:53,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:54,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:54,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:54,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200707585] [2025-02-06 10:33:54,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200707585] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:54,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:54,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 10:33:54,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029416106] [2025-02-06 10:33:54,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:54,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:33:54,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:54,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:33:54,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:33:54,233 INFO L87 Difference]: Start difference. First operand 345 states and 406 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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-02-06 10:33:54,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:54,529 INFO L93 Difference]: Finished difference Result 363 states and 420 transitions. [2025-02-06 10:33:54,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:33:54,529 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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 52 [2025-02-06 10:33:54,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:54,530 INFO L225 Difference]: With dead ends: 363 [2025-02-06 10:33:54,530 INFO L226 Difference]: Without dead ends: 363 [2025-02-06 10:33:54,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:33:54,531 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 205 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:54,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 512 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:33:54,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-02-06 10:33:54,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 343. [2025-02-06 10:33:54,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 318 states have (on average 1.251572327044025) internal successors, (398), 341 states have internal predecessors, (398), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:54,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 403 transitions. [2025-02-06 10:33:54,537 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 403 transitions. Word has length 52 [2025-02-06 10:33:54,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:54,538 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 403 transitions. [2025-02-06 10:33:54,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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-02-06 10:33:54,538 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 403 transitions. [2025-02-06 10:33:54,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 10:33:54,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:54,538 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:54,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-06 10:33:54,539 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:54,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:54,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1423713786, now seen corresponding path program 1 times [2025-02-06 10:33:54,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:54,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380536880] [2025-02-06 10:33:54,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:54,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:54,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 10:33:54,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 10:33:54,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:54,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:54,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:54,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:54,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380536880] [2025-02-06 10:33:54,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380536880] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:54,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:54,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:33:54,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120343541] [2025-02-06 10:33:54,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:54,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:33:54,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:54,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:33:54,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:33:54,578 INFO L87 Difference]: Start difference. First operand 343 states and 403 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-02-06 10:33:54,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:54,590 INFO L93 Difference]: Finished difference Result 410 states and 487 transitions. [2025-02-06 10:33:54,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:33:54,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 53 [2025-02-06 10:33:54,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:54,592 INFO L225 Difference]: With dead ends: 410 [2025-02-06 10:33:54,592 INFO L226 Difference]: Without dead ends: 410 [2025-02-06 10:33:54,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:33:54,592 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 11 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:54,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 307 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:33:54,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-02-06 10:33:54,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 390. [2025-02-06 10:33:54,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 365 states have (on average 1.2767123287671234) internal successors, (466), 388 states have internal predecessors, (466), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:54,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 471 transitions. [2025-02-06 10:33:54,598 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 471 transitions. Word has length 53 [2025-02-06 10:33:54,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:54,598 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 471 transitions. [2025-02-06 10:33:54,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-02-06 10:33:54,599 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 471 transitions. [2025-02-06 10:33:54,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-06 10:33:54,599 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:54,599 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:54,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-06 10:33:54,599 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:54,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:54,600 INFO L85 PathProgramCache]: Analyzing trace with hash 887596998, now seen corresponding path program 1 times [2025-02-06 10:33:54,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:54,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543569635] [2025-02-06 10:33:54,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:54,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:54,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 10:33:54,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 10:33:54,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:54,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:54,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:33:54,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:54,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543569635] [2025-02-06 10:33:54,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543569635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:54,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:54,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 10:33:54,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901196015] [2025-02-06 10:33:54,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:54,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:33:54,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:54,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:33:54,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:33:54,778 INFO L87 Difference]: Start difference. First operand 390 states and 471 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:55,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:55,110 INFO L93 Difference]: Finished difference Result 381 states and 457 transitions. [2025-02-06 10:33:55,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:33:55,110 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 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 52 [2025-02-06 10:33:55,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:55,111 INFO L225 Difference]: With dead ends: 381 [2025-02-06 10:33:55,111 INFO L226 Difference]: Without dead ends: 381 [2025-02-06 10:33:55,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-02-06 10:33:55,112 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 254 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:55,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 743 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:33:55,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-02-06 10:33:55,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 365. [2025-02-06 10:33:55,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 340 states have (on average 1.2911764705882354) internal successors, (439), 363 states have internal predecessors, (439), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:55,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 444 transitions. [2025-02-06 10:33:55,117 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 444 transitions. Word has length 52 [2025-02-06 10:33:55,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:55,117 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 444 transitions. [2025-02-06 10:33:55,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:55,117 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 444 transitions. [2025-02-06 10:33:55,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-06 10:33:55,118 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:55,118 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:55,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-06 10:33:55,118 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:55,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:55,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1385806789, now seen corresponding path program 1 times [2025-02-06 10:33:55,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:55,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942794467] [2025-02-06 10:33:55,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:55,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:55,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 10:33:55,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 10:33:55,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:55,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:55,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:55,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:55,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942794467] [2025-02-06 10:33:55,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942794467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:55,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:55,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:33:55,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028908052] [2025-02-06 10:33:55,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:55,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:33:55,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:55,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:33:55,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:33:55,213 INFO L87 Difference]: Start difference. First operand 365 states and 444 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:55,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:55,304 INFO L93 Difference]: Finished difference Result 298 states and 341 transitions. [2025-02-06 10:33:55,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:33:55,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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 54 [2025-02-06 10:33:55,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:55,305 INFO L225 Difference]: With dead ends: 298 [2025-02-06 10:33:55,305 INFO L226 Difference]: Without dead ends: 298 [2025-02-06 10:33:55,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-06 10:33:55,307 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:55,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 606 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:55,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-02-06 10:33:55,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2025-02-06 10:33:55,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 273 states have (on average 1.2307692307692308) internal successors, (336), 295 states have internal predecessors, (336), 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-02-06 10:33:55,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 340 transitions. [2025-02-06 10:33:55,312 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 340 transitions. Word has length 54 [2025-02-06 10:33:55,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:55,312 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 340 transitions. [2025-02-06 10:33:55,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:55,312 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 340 transitions. [2025-02-06 10:33:55,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-06 10:33:55,313 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:55,313 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:55,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-06 10:33:55,313 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:55,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:55,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1237436073, now seen corresponding path program 1 times [2025-02-06 10:33:55,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:55,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086204147] [2025-02-06 10:33:55,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:55,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:55,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 10:33:55,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 10:33:55,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:55,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:55,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:33:55,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:55,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086204147] [2025-02-06 10:33:55,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086204147] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:55,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:55,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:33:55,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825506087] [2025-02-06 10:33:55,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:55,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:33:55,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:55,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:33:55,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:33:55,423 INFO L87 Difference]: Start difference. First operand 297 states and 340 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:55,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:55,520 INFO L93 Difference]: Finished difference Result 311 states and 354 transitions. [2025-02-06 10:33:55,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:33:55,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 57 [2025-02-06 10:33:55,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:55,521 INFO L225 Difference]: With dead ends: 311 [2025-02-06 10:33:55,521 INFO L226 Difference]: Without dead ends: 311 [2025-02-06 10:33:55,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:33:55,522 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 11 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:55,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 525 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:55,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-02-06 10:33:55,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 301. [2025-02-06 10:33:55,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 277 states have (on average 1.2238267148014441) internal successors, (339), 299 states have internal predecessors, (339), 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-02-06 10:33:55,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 343 transitions. [2025-02-06 10:33:55,528 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 343 transitions. Word has length 57 [2025-02-06 10:33:55,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:55,528 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 343 transitions. [2025-02-06 10:33:55,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:55,529 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 343 transitions. [2025-02-06 10:33:55,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-06 10:33:55,529 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:55,529 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:55,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-06 10:33:55,529 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:55,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:55,530 INFO L85 PathProgramCache]: Analyzing trace with hash 225047593, now seen corresponding path program 1 times [2025-02-06 10:33:55,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:55,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176768183] [2025-02-06 10:33:55,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:55,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:55,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 10:33:55,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 10:33:55,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:55,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:55,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:55,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:55,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176768183] [2025-02-06 10:33:55,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176768183] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:33:55,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515616194] [2025-02-06 10:33:55,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:55,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:33:55,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:33:55,782 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:33:55,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 10:33:55,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 10:33:55,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 10:33:55,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:55,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:55,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 10:33:55,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:33:55,928 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-02-06 10:33:56,052 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 10:33:56,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 10:33:56,104 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-02-06 10:33:56,238 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-06 10:33:56,238 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-02-06 10:33:56,341 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:33:56,341 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-02-06 10:33:56,536 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-02-06 10:33:56,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:56,604 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:33:57,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:33:57,017 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-02-06 10:33:57,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:33:57,028 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-02-06 10:33:57,033 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-02-06 10:33:57,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:57,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515616194] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:33:57,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:33:57,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2025-02-06 10:33:57,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704851302] [2025-02-06 10:33:57,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:33:57,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-06 10:33:57,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:57,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-06 10:33:57,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=732, Unknown=10, NotChecked=0, Total=870 [2025-02-06 10:33:57,952 INFO L87 Difference]: Start difference. First operand 301 states and 343 transitions. Second operand has 30 states, 29 states have (on average 5.931034482758621) internal successors, (172), 30 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:59,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:59,129 INFO L93 Difference]: Finished difference Result 521 states and 581 transitions. [2025-02-06 10:33:59,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 10:33:59,130 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 5.931034482758621) internal successors, (172), 30 states have internal predecessors, (172), 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 59 [2025-02-06 10:33:59,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:59,131 INFO L225 Difference]: With dead ends: 521 [2025-02-06 10:33:59,131 INFO L226 Difference]: Without dead ends: 521 [2025-02-06 10:33:59,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=200, Invalid=1050, Unknown=10, NotChecked=0, Total=1260 [2025-02-06 10:33:59,132 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1242 mSDsluCounter, 2194 mSDsCounter, 0 mSdLazyCounter, 2010 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1242 SdHoareTripleChecker+Valid, 2342 SdHoareTripleChecker+Invalid, 2082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:59,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1242 Valid, 2342 Invalid, 2082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2010 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 10:33:59,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-02-06 10:33:59,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 355. [2025-02-06 10:33:59,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 331 states have (on average 1.2205438066465257) internal successors, (404), 353 states have internal predecessors, (404), 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-02-06 10:33:59,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 408 transitions. [2025-02-06 10:33:59,137 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 408 transitions. Word has length 59 [2025-02-06 10:33:59,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:59,137 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 408 transitions. [2025-02-06 10:33:59,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 5.931034482758621) internal successors, (172), 30 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:59,137 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 408 transitions. [2025-02-06 10:33:59,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-06 10:33:59,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:59,138 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:59,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 10:33:59,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2025-02-06 10:33:59,340 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:33:59,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:59,340 INFO L85 PathProgramCache]: Analyzing trace with hash 225047594, now seen corresponding path program 1 times [2025-02-06 10:33:59,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:59,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178619847] [2025-02-06 10:33:59,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:59,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:59,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 10:33:59,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 10:33:59,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:59,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:59,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:33:59,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:59,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178619847] [2025-02-06 10:33:59,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178619847] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:33:59,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443482026] [2025-02-06 10:33:59,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:59,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:33:59,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:33:59,689 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:33:59,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 10:33:59,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 10:33:59,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 10:33:59,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:59,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:59,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-06 10:33:59,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:33:59,822 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-02-06 10:33:59,918 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:33: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 11 treesize of output 11 [2025-02-06 10:33:59,925 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-02-06 10:33:59,959 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-02-06 10:33:59,967 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-02-06 10:34:00,104 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:34:00,105 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-02-06 10:34:00,119 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-06 10:34:00,119 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-02-06 10:34:00,234 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:34:00,234 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-02-06 10:34:00,241 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-02-06 10:34:00,444 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-02-06 10:34:00,448 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-02-06 10:34:00,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:00,493 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:34:01,191 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_81| Int) (v_ArrVal_1172 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_81|) (< (+ 7 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1172) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_81|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1171) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_81|))) (< |v_ULTIMATE.start_main_~end~0#1.offset_81| 0))) (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_81| Int) (v_ArrVal_1172 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_81|) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1172) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_81|) 5)) (< |v_ULTIMATE.start_main_~end~0#1.offset_81| 0))))) is different from false [2025-02-06 10:34:01,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:34:01,218 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-02-06 10:34:01,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:34:01,225 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-02-06 10:34:01,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:34:01,235 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-02-06 10:34:01,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:34:01,250 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-02-06 10:34:01,256 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-02-06 10:34:01,269 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-02-06 10:34:01,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:34:01,320 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-02-06 10:34:01,323 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:34:01,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:01,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:01,327 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-02-06 10:34:01,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:01,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443482026] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:34:01,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:34:01,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2025-02-06 10:34:01,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317950520] [2025-02-06 10:34:01,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:34:01,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-06 10:34:01,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:01,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-06 10:34:01,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=827, Unknown=12, NotChecked=58, Total=992 [2025-02-06 10:34:01,634 INFO L87 Difference]: Start difference. First operand 355 states and 408 transitions. Second operand has 32 states, 31 states have (on average 5.645161290322581) internal successors, (175), 32 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:03,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:03,252 INFO L93 Difference]: Finished difference Result 498 states and 557 transitions. [2025-02-06 10:34:03,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 10:34:03,252 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 5.645161290322581) internal successors, (175), 32 states have internal predecessors, (175), 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 59 [2025-02-06 10:34:03,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:03,253 INFO L225 Difference]: With dead ends: 498 [2025-02-06 10:34:03,253 INFO L226 Difference]: Without dead ends: 498 [2025-02-06 10:34:03,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=294, Invalid=1768, Unknown=12, NotChecked=88, Total=2162 [2025-02-06 10:34:03,254 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1101 mSDsluCounter, 2240 mSDsCounter, 0 mSdLazyCounter, 2329 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1101 SdHoareTripleChecker+Valid, 2392 SdHoareTripleChecker+Invalid, 2756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 381 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:03,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1101 Valid, 2392 Invalid, 2756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2329 Invalid, 0 Unknown, 381 Unchecked, 1.2s Time] [2025-02-06 10:34:03,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-02-06 10:34:03,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 376. [2025-02-06 10:34:03,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 352 states have (on average 1.2244318181818181) internal successors, (431), 374 states have internal predecessors, (431), 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-02-06 10:34:03,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 435 transitions. [2025-02-06 10:34:03,259 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 435 transitions. Word has length 59 [2025-02-06 10:34:03,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:03,259 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 435 transitions. [2025-02-06 10:34:03,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 5.645161290322581) internal successors, (175), 32 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:03,259 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 435 transitions. [2025-02-06 10:34:03,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 10:34:03,260 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:03,260 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:34:03,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 10:34:03,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2025-02-06 10:34:03,464 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 63 more)] === [2025-02-06 10:34:03,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:03,464 INFO L85 PathProgramCache]: Analyzing trace with hash -691052687, now seen corresponding path program 1 times [2025-02-06 10:34:03,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:03,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423459412] [2025-02-06 10:34:03,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:03,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:03,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 10:34:03,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 10:34:03,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:03,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:04,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:04,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:04,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423459412] [2025-02-06 10:34:04,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423459412] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:34:04,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206669614] [2025-02-06 10:34:04,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:04,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:34:04,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:34:04,210 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:34:04,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 10:34:04,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 10:34:04,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 10:34:04,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:04,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:04,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-02-06 10:34:04,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:34:04,371 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-02-06 10:34:04,396 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-02-06 10:34:04,401 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-02-06 10:34:04,526 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:34:04,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:34:04,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:04,583 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-02-06 10:34:04,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:04,600 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-02-06 10:34:04,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:04,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-02-06 10:34:04,808 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-06 10:34:04,808 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 31 treesize of output 22 [2025-02-06 10:34:04,972 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:34:04,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:34:05,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:05,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:05,074 INFO L349 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2025-02-06 10:34:05,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 25 [2025-02-06 10:34:05,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:05,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:05,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 24 [2025-02-06 10:34:05,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:05,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:05,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:05,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:05,282 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-02-06 10:34:05,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 56 [2025-02-06 10:34:05,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:05,302 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2025-02-06 10:34:05,302 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 1 case distinctions, treesize of input 60 treesize of output 50 [2025-02-06 10:34:05,313 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 7 [2025-02-06 10:34:05,723 INFO L349 Elim1Store]: treesize reduction 104, result has 44.1 percent of original size [2025-02-06 10:34:05,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 189 treesize of output 226 [2025-02-06 10:34:05,758 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2025-02-06 10:34:05,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 133 [2025-02-06 10:34:05,845 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 7 [2025-02-06 10:34:09,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:09,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2025-02-06 10:34:12,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:12,074 INFO L349 Elim1Store]: treesize reduction 4, result has 78.9 percent of original size [2025-02-06 10:34:12,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 29 [2025-02-06 10:34:12,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:12,526 INFO L349 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2025-02-06 10:34:12,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 28 [2025-02-06 10:34:12,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:12,751 INFO L349 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2025-02-06 10:34:12,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 28 [2025-02-06 10:34:12,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:12,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2025-02-06 10:34:12,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:12,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2025-02-06 10:34:13,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:13,513 INFO L349 Elim1Store]: treesize reduction 4, result has 78.9 percent of original size [2025-02-06 10:34:13,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 33 [2025-02-06 10:34:14,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:14,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2025-02-06 10:34:14,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:14,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2025-02-06 10:34:15,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:15,093 INFO L349 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2025-02-06 10:34:15,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 32 [2025-02-06 10:34:16,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:16,224 INFO L349 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2025-02-06 10:34:16,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 28 [2025-02-06 10:34:18,553 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-02-06 10:34:18,576 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-02-06 10:34:19,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:34:19,408 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 18 treesize of output 22 [2025-02-06 10:34:19,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:19,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2025-02-06 10:34:19,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:34:19,505 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 17 treesize of output 21 [2025-02-06 10:34:19,649 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-02-06 10:34:19,825 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-02-06 10:34:21,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:34:21,201 INFO L349 Elim1Store]: treesize reduction 4, result has 78.9 percent of original size [2025-02-06 10:34:21,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33