./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-buckets-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d 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-buckets-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 c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:36:58,063 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:36:58,119 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:36:58,125 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:36:58,126 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:36:58,152 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:36:58,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:36:58,152 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:36:58,153 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:36:58,153 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:36:58,153 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:36:58,153 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:36:58,153 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:36:58,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:36:58,153 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:36:58,153 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:36:58,153 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:36:58,153 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:36:58,153 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:36:58,153 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:36:58,153 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:36:58,153 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:36:58,153 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:36:58,154 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:36:58,154 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:36:58,154 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:36:58,154 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:36:58,154 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:36:58,154 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:36:58,154 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:36:58,154 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:36:58,154 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:36:58,154 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:36:58,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:36:58,154 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:36:58,154 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:36:58,154 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:36:58,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:36:58,154 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:36:58,154 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:36:58,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:36:58,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:36:58,154 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 -> c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac [2025-02-08 06:36:58,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:36:58,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:36:58,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:36:58,457 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:36:58,457 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:36:58,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-buckets-1.i [2025-02-08 06:36:59,655 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32f37f7c9/d9acae2230b04a4f95b522e1d762f763/FLAG08dc31237 [2025-02-08 06:36:59,972 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:36:59,972 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i [2025-02-08 06:36:59,987 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32f37f7c9/d9acae2230b04a4f95b522e1d762f763/FLAG08dc31237 [2025-02-08 06:37:00,013 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32f37f7c9/d9acae2230b04a4f95b522e1d762f763 [2025-02-08 06:37:00,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:37:00,017 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:37:00,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:37:00,020 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:37:00,023 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:37:00,024 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:37:00" (1/1) ... [2025-02-08 06:37:00,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48535641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:37:00, skipping insertion in model container [2025-02-08 06:37:00,026 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:37:00" (1/1) ... [2025-02-08 06:37:00,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:37:00,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:37:00,259 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:37:00,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:37:00,332 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:37:00,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:37:00 WrapperNode [2025-02-08 06:37:00,333 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:37:00,334 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:37:00,334 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:37:00,334 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:37:00,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:37:00" (1/1) ... [2025-02-08 06:37:00,355 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:37:00" (1/1) ... [2025-02-08 06:37:00,378 INFO L138 Inliner]: procedures = 119, calls = 47, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 147 [2025-02-08 06:37:00,379 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:37:00,379 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:37:00,379 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:37:00,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:37:00,386 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:37:00" (1/1) ... [2025-02-08 06:37:00,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:37:00" (1/1) ... [2025-02-08 06:37:00,391 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:37:00" (1/1) ... [2025-02-08 06:37:00,409 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 16 writes are split as follows [0, 16]. [2025-02-08 06:37:00,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:37:00" (1/1) ... [2025-02-08 06:37:00,412 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:37:00" (1/1) ... [2025-02-08 06:37:00,418 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:37:00" (1/1) ... [2025-02-08 06:37:00,419 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:37:00" (1/1) ... [2025-02-08 06:37:00,420 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:37:00" (1/1) ... [2025-02-08 06:37:00,420 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:37:00" (1/1) ... [2025-02-08 06:37:00,426 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:37:00,427 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:37:00,427 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:37:00,427 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:37:00,427 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:37:00" (1/1) ... [2025-02-08 06:37:00,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:37:00,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:37:00,451 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-08 06:37:00,456 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-08 06:37:00,473 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-08 06:37:00,473 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-08 06:37:00,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:37:00,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:37:00,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:37:00,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:37:00,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:37:00,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:37:00,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:37:00,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:37:00,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:37:00,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:37:00,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:37:00,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:37:00,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:37:00,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:37:00,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:37:00,559 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:37:00,560 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:37:00,939 INFO L? ?]: Removed 143 outVars from TransFormulas that were not future-live. [2025-02-08 06:37:00,939 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:37:00,948 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:37:00,948 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:37:00,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:37:00 BoogieIcfgContainer [2025-02-08 06:37:00,949 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:37:00,950 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:37:00,951 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:37:00,954 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:37:00,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:37:00" (1/3) ... [2025-02-08 06:37:00,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f9e9c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:37:00, skipping insertion in model container [2025-02-08 06:37:00,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:37:00" (2/3) ... [2025-02-08 06:37:00,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f9e9c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:37:00, skipping insertion in model container [2025-02-08 06:37:00,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:37:00" (3/3) ... [2025-02-08 06:37:00,956 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-buckets-1.i [2025-02-08 06:37:00,975 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:37:00,976 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-buckets-1.i that has 2 procedures, 165 locations, 1 initial locations, 10 loop locations, and 68 error locations. [2025-02-08 06:37:01,012 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:37:01,023 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;@89ab638, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:37:01,023 INFO L334 AbstractCegarLoop]: Starting to check reachability of 68 error locations. [2025-02-08 06:37:01,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 165 states, 90 states have (on average 2.0555555555555554) internal successors, (185), 158 states have internal predecessors, (185), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 06:37:01,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 06:37:01,031 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:01,031 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 06:37:01,032 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-02-08 06:37:01,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:01,036 INFO L85 PathProgramCache]: Analyzing trace with hash 7039, now seen corresponding path program 1 times [2025-02-08 06:37:01,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:01,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475374460] [2025-02-08 06:37:01,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:01,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:01,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 06:37:01,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 06:37:01,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:01,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:01,164 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-08 06:37:01,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:01,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475374460] [2025-02-08 06:37:01,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475374460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:37:01,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:37:01,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:37:01,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549156503] [2025-02-08 06:37:01,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:37:01,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:37:01,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:01,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:37:01,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:37:01,187 INFO L87 Difference]: Start difference. First operand has 165 states, 90 states have (on average 2.0555555555555554) internal successors, (185), 158 states have internal predecessors, (185), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:01,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:01,315 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2025-02-08 06:37:01,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:37:01,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-02-08 06:37:01,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:01,321 INFO L225 Difference]: With dead ends: 154 [2025-02-08 06:37:01,321 INFO L226 Difference]: Without dead ends: 152 [2025-02-08 06:37:01,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:37:01,324 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 100 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:01,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 144 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:37:01,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-02-08 06:37:01,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-02-08 06:37:01,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 83 states have (on average 1.9036144578313252) internal successors, (158), 150 states have internal predecessors, (158), 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-08 06:37:01,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 163 transitions. [2025-02-08 06:37:01,350 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 163 transitions. Word has length 2 [2025-02-08 06:37:01,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:01,350 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 163 transitions. [2025-02-08 06:37:01,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:01,350 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 163 transitions. [2025-02-08 06:37:01,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 06:37:01,350 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:01,351 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 06:37:01,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:37:01,351 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-02-08 06:37:01,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:01,351 INFO L85 PathProgramCache]: Analyzing trace with hash 7040, now seen corresponding path program 1 times [2025-02-08 06:37:01,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:01,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802287946] [2025-02-08 06:37:01,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:01,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:01,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 06:37:01,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 06:37:01,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:01,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:01,403 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-08 06:37:01,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:01,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802287946] [2025-02-08 06:37:01,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802287946] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:37:01,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:37:01,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:37:01,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985231917] [2025-02-08 06:37:01,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:37:01,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:37:01,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:01,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:37:01,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:37:01,406 INFO L87 Difference]: Start difference. First operand 152 states and 163 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:01,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:01,487 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2025-02-08 06:37:01,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:37:01,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-02-08 06:37:01,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:01,489 INFO L225 Difference]: With dead ends: 151 [2025-02-08 06:37:01,489 INFO L226 Difference]: Without dead ends: 151 [2025-02-08 06:37:01,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:37:01,489 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 32 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:01,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 215 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:37:01,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-02-08 06:37:01,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2025-02-08 06:37:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 83 states have (on average 1.855421686746988) internal successors, (154), 146 states have internal predecessors, (154), 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-08 06:37:01,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2025-02-08 06:37:01,495 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 159 transitions. Word has length 2 [2025-02-08 06:37:01,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:01,495 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 159 transitions. [2025-02-08 06:37:01,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:01,495 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2025-02-08 06:37:01,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 06:37:01,495 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:01,496 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:37:01,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:37:01,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-02-08 06:37:01,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:01,496 INFO L85 PathProgramCache]: Analyzing trace with hash 680368850, now seen corresponding path program 1 times [2025-02-08 06:37:01,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:01,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833059099] [2025-02-08 06:37:01,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:01,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:01,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 06:37:01,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 06:37:01,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:01,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:01,708 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-08 06:37:01,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:01,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833059099] [2025-02-08 06:37:01,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833059099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:37:01,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:37:01,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:37:01,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824511029] [2025-02-08 06:37:01,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:37:01,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:37:01,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:01,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:37:01,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:37:01,711 INFO L87 Difference]: Start difference. First operand 148 states and 159 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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-08 06:37:01,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:01,938 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2025-02-08 06:37:01,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:37:01,939 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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 9 [2025-02-08 06:37:01,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:01,940 INFO L225 Difference]: With dead ends: 153 [2025-02-08 06:37:01,940 INFO L226 Difference]: Without dead ends: 153 [2025-02-08 06:37:01,940 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-08 06:37:01,940 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 46 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:01,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 367 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:37:01,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-08 06:37:01,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 148. [2025-02-08 06:37:01,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 94 states have (on average 1.7234042553191489) internal successors, (162), 146 states have internal predecessors, (162), 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-08 06:37:01,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 167 transitions. [2025-02-08 06:37:01,946 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 167 transitions. Word has length 9 [2025-02-08 06:37:01,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:01,946 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 167 transitions. [2025-02-08 06:37:01,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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-08 06:37:01,946 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 167 transitions. [2025-02-08 06:37:01,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 06:37:01,946 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:01,947 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:37:01,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:37:01,947 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-02-08 06:37:01,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:01,947 INFO L85 PathProgramCache]: Analyzing trace with hash 680368851, now seen corresponding path program 1 times [2025-02-08 06:37:01,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:01,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408484343] [2025-02-08 06:37:01,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:01,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:01,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 06:37:01,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 06:37:01,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:01,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:02,110 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-08 06:37:02,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:02,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408484343] [2025-02-08 06:37:02,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408484343] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:37:02,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:37:02,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:37:02,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368441768] [2025-02-08 06:37:02,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:37:02,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:37:02,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:02,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:37:02,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:37:02,111 INFO L87 Difference]: Start difference. First operand 148 states and 167 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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-08 06:37:02,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:02,276 INFO L93 Difference]: Finished difference Result 144 states and 163 transitions. [2025-02-08 06:37:02,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:37:02,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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 9 [2025-02-08 06:37:02,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:02,277 INFO L225 Difference]: With dead ends: 144 [2025-02-08 06:37:02,277 INFO L226 Difference]: Without dead ends: 144 [2025-02-08 06:37:02,277 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-08 06:37:02,278 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 6 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:02,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 455 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:37:02,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-02-08 06:37:02,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-02-08 06:37:02,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 94 states have (on average 1.6808510638297873) internal successors, (158), 142 states have internal predecessors, (158), 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-08 06:37:02,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 163 transitions. [2025-02-08 06:37:02,283 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 163 transitions. Word has length 9 [2025-02-08 06:37:02,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:02,283 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 163 transitions. [2025-02-08 06:37:02,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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-08 06:37:02,283 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 163 transitions. [2025-02-08 06:37:02,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 06:37:02,283 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:02,284 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:37:02,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:37:02,284 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-02-08 06:37:02,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:02,284 INFO L85 PathProgramCache]: Analyzing trace with hash -424398416, now seen corresponding path program 1 times [2025-02-08 06:37:02,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:02,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434859188] [2025-02-08 06:37:02,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:02,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:02,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 06:37:02,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 06:37:02,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:02,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:02,397 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-08 06:37:02,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:02,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434859188] [2025-02-08 06:37:02,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434859188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:37:02,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:37:02,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:37:02,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764826370] [2025-02-08 06:37:02,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:37:02,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:37:02,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:02,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:37:02,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:37:02,399 INFO L87 Difference]: Start difference. First operand 144 states and 163 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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-08 06:37:02,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:02,565 INFO L93 Difference]: Finished difference Result 148 states and 163 transitions. [2025-02-08 06:37:02,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:37:02,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2025-02-08 06:37:02,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:02,566 INFO L225 Difference]: With dead ends: 148 [2025-02-08 06:37:02,566 INFO L226 Difference]: Without dead ends: 148 [2025-02-08 06:37:02,566 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-08 06:37:02,567 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 43 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:02,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 359 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:37:02,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-02-08 06:37:02,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143. [2025-02-08 06:37:02,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 94 states have (on average 1.6702127659574468) internal successors, (157), 141 states have internal predecessors, (157), 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-08 06:37:02,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 162 transitions. [2025-02-08 06:37:02,571 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 162 transitions. Word has length 16 [2025-02-08 06:37:02,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:02,571 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 162 transitions. [2025-02-08 06:37:02,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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-08 06:37:02,572 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 162 transitions. [2025-02-08 06:37:02,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 06:37:02,572 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:02,572 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:37:02,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:37:02,572 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-02-08 06:37:02,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:02,573 INFO L85 PathProgramCache]: Analyzing trace with hash -424398415, now seen corresponding path program 1 times [2025-02-08 06:37:02,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:02,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33031389] [2025-02-08 06:37:02,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:02,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:02,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 06:37:02,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 06:37:02,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:02,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:02,728 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-08 06:37:02,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:02,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33031389] [2025-02-08 06:37:02,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33031389] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:37:02,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:37:02,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:37:02,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816778437] [2025-02-08 06:37:02,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:37:02,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:37:02,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:02,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:37:02,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:37:02,730 INFO L87 Difference]: Start difference. First operand 143 states and 162 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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-08 06:37:02,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:02,882 INFO L93 Difference]: Finished difference Result 140 states and 159 transitions. [2025-02-08 06:37:02,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:37:02,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2025-02-08 06:37:02,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:02,883 INFO L225 Difference]: With dead ends: 140 [2025-02-08 06:37:02,883 INFO L226 Difference]: Without dead ends: 140 [2025-02-08 06:37:02,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:37:02,884 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 2 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:02,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 444 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:37:02,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-08 06:37:02,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-02-08 06:37:02,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 94 states have (on average 1.6382978723404256) internal successors, (154), 138 states have internal predecessors, (154), 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-08 06:37:02,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 159 transitions. [2025-02-08 06:37:02,888 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 159 transitions. Word has length 16 [2025-02-08 06:37:02,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:02,888 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 159 transitions. [2025-02-08 06:37:02,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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-08 06:37:02,888 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 159 transitions. [2025-02-08 06:37:02,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-08 06:37:02,889 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:02,889 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] [2025-02-08 06:37:02,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:37:02,889 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-02-08 06:37:02,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:02,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1506708677, now seen corresponding path program 1 times [2025-02-08 06:37:02,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:02,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902659195] [2025-02-08 06:37:02,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:02,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:02,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 06:37:02,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 06:37:02,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:02,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:02,945 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-08 06:37:02,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:02,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902659195] [2025-02-08 06:37:02,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902659195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:37:02,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:37:02,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:37:02,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649975224] [2025-02-08 06:37:02,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:37:02,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:37:02,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:02,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:37:02,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:37:02,947 INFO L87 Difference]: Start difference. First operand 140 states and 159 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-08 06:37:03,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:03,008 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2025-02-08 06:37:03,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:37:03,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-08 06:37:03,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:03,009 INFO L225 Difference]: With dead ends: 135 [2025-02-08 06:37:03,009 INFO L226 Difference]: Without dead ends: 135 [2025-02-08 06:37:03,009 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-08 06:37:03,009 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 52 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:03,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 146 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:37:03,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-08 06:37:03,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-02-08 06:37:03,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 94 states have (on average 1.5851063829787233) internal successors, (149), 133 states have internal predecessors, (149), 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-08 06:37:03,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 154 transitions. [2025-02-08 06:37:03,013 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 154 transitions. Word has length 22 [2025-02-08 06:37:03,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:03,013 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 154 transitions. [2025-02-08 06:37:03,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-08 06:37:03,013 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 154 transitions. [2025-02-08 06:37:03,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-08 06:37:03,013 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:03,014 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] [2025-02-08 06:37:03,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 06:37:03,014 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-02-08 06:37:03,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:03,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1506708678, now seen corresponding path program 1 times [2025-02-08 06:37:03,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:03,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605306110] [2025-02-08 06:37:03,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:03,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:03,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 06:37:03,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 06:37:03,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:03,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:03,091 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-08 06:37:03,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:03,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605306110] [2025-02-08 06:37:03,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605306110] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:37:03,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:37:03,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:37:03,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866035404] [2025-02-08 06:37:03,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:37:03,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:37:03,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:03,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:37:03,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:37:03,093 INFO L87 Difference]: Start difference. First operand 135 states and 154 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-08 06:37:03,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:03,166 INFO L93 Difference]: Finished difference Result 130 states and 149 transitions. [2025-02-08 06:37:03,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:37:03,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-08 06:37:03,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:03,168 INFO L225 Difference]: With dead ends: 130 [2025-02-08 06:37:03,168 INFO L226 Difference]: Without dead ends: 130 [2025-02-08 06:37:03,168 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-08 06:37:03,168 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 52 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:03,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 146 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:37:03,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-02-08 06:37:03,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-02-08 06:37:03,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 94 states have (on average 1.5319148936170213) internal successors, (144), 128 states have internal predecessors, (144), 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-08 06:37:03,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 149 transitions. [2025-02-08 06:37:03,171 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 149 transitions. Word has length 22 [2025-02-08 06:37:03,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:03,171 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 149 transitions. [2025-02-08 06:37:03,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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-08 06:37:03,171 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 149 transitions. [2025-02-08 06:37:03,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 06:37:03,172 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:03,172 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:37:03,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 06:37:03,172 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-02-08 06:37:03,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:03,173 INFO L85 PathProgramCache]: Analyzing trace with hash 542952436, now seen corresponding path program 1 times [2025-02-08 06:37:03,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:03,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085995381] [2025-02-08 06:37:03,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:03,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:03,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 06:37:03,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:37:03,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:03,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:03,223 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-08 06:37:03,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:03,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085995381] [2025-02-08 06:37:03,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085995381] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:37:03,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:37:03,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:37:03,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975954844] [2025-02-08 06:37:03,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:37:03,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:37:03,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:03,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:37:03,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:37:03,225 INFO L87 Difference]: Start difference. First operand 130 states and 149 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:03,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:03,294 INFO L93 Difference]: Finished difference Result 188 states and 232 transitions. [2025-02-08 06:37:03,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:37:03,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-08 06:37:03,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:03,296 INFO L225 Difference]: With dead ends: 188 [2025-02-08 06:37:03,296 INFO L226 Difference]: Without dead ends: 188 [2025-02-08 06:37:03,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:37:03,296 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 128 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:03,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 202 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:37:03,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-02-08 06:37:03,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 136. [2025-02-08 06:37:03,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 101 states have (on average 1.5148514851485149) internal successors, (153), 134 states have internal predecessors, (153), 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-08 06:37:03,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 157 transitions. [2025-02-08 06:37:03,300 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 157 transitions. Word has length 24 [2025-02-08 06:37:03,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:03,300 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 157 transitions. [2025-02-08 06:37:03,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:03,300 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 157 transitions. [2025-02-08 06:37:03,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 06:37:03,300 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:03,301 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:37:03,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:37:03,301 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-02-08 06:37:03,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:03,301 INFO L85 PathProgramCache]: Analyzing trace with hash 542954131, now seen corresponding path program 1 times [2025-02-08 06:37:03,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:03,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651425952] [2025-02-08 06:37:03,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:03,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:03,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 06:37:03,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:37:03,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:03,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:03,396 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-08 06:37:03,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:03,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651425952] [2025-02-08 06:37:03,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651425952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:37:03,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:37:03,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:37:03,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896459104] [2025-02-08 06:37:03,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:37:03,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:37:03,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:03,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:37:03,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:37:03,398 INFO L87 Difference]: Start difference. First operand 136 states and 157 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:03,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:03,545 INFO L93 Difference]: Finished difference Result 148 states and 165 transitions. [2025-02-08 06:37:03,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:37:03,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-08 06:37:03,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:03,546 INFO L225 Difference]: With dead ends: 148 [2025-02-08 06:37:03,546 INFO L226 Difference]: Without dead ends: 148 [2025-02-08 06:37:03,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-08 06:37:03,546 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 114 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:03,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 125 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:37:03,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-02-08 06:37:03,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 141. [2025-02-08 06:37:03,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 106 states have (on average 1.509433962264151) internal successors, (160), 139 states have internal predecessors, (160), 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-08 06:37:03,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 164 transitions. [2025-02-08 06:37:03,549 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 164 transitions. Word has length 24 [2025-02-08 06:37:03,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:03,549 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 164 transitions. [2025-02-08 06:37:03,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:03,549 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 164 transitions. [2025-02-08 06:37:03,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 06:37:03,550 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:03,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:37:03,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 06:37:03,550 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-02-08 06:37:03,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:03,550 INFO L85 PathProgramCache]: Analyzing trace with hash 542954132, now seen corresponding path program 1 times [2025-02-08 06:37:03,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:03,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039054927] [2025-02-08 06:37:03,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:03,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:03,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 06:37:03,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:37:03,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:03,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:03,816 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-08 06:37:03,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:03,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039054927] [2025-02-08 06:37:03,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039054927] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:37:03,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:37:03,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:37:03,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533875780] [2025-02-08 06:37:03,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:37:03,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:37:03,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:03,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:37:03,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:37:03,819 INFO L87 Difference]: Start difference. First operand 141 states and 164 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:04,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:04,026 INFO L93 Difference]: Finished difference Result 190 states and 222 transitions. [2025-02-08 06:37:04,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 06:37:04,028 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-08 06:37:04,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:04,029 INFO L225 Difference]: With dead ends: 190 [2025-02-08 06:37:04,029 INFO L226 Difference]: Without dead ends: 190 [2025-02-08 06:37:04,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:37:04,029 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 268 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:04,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 252 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:37:04,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-02-08 06:37:04,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 180. [2025-02-08 06:37:04,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 145 states have (on average 1.4896551724137932) internal successors, (216), 178 states have internal predecessors, (216), 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-08 06:37:04,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 220 transitions. [2025-02-08 06:37:04,034 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 220 transitions. Word has length 24 [2025-02-08 06:37:04,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:04,034 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 220 transitions. [2025-02-08 06:37:04,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:04,034 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 220 transitions. [2025-02-08 06:37:04,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 06:37:04,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:04,036 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:37:04,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 06:37:04,036 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-02-08 06:37:04,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:04,037 INFO L85 PathProgramCache]: Analyzing trace with hash 700939181, now seen corresponding path program 1 times [2025-02-08 06:37:04,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:04,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037135587] [2025-02-08 06:37:04,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:04,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:04,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 06:37:04,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 06:37:04,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:04,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:04,772 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-08 06:37:04,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:04,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037135587] [2025-02-08 06:37:04,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037135587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:37:04,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:37:04,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-08 06:37:04,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268683058] [2025-02-08 06:37:04,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:37:04,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 06:37:04,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:04,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 06:37:04,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-02-08 06:37:04,775 INFO L87 Difference]: Start difference. First operand 180 states and 220 transitions. Second operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:05,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:05,296 INFO L93 Difference]: Finished difference Result 201 states and 240 transitions. [2025-02-08 06:37:05,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 06:37:05,296 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-02-08 06:37:05,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:05,297 INFO L225 Difference]: With dead ends: 201 [2025-02-08 06:37:05,297 INFO L226 Difference]: Without dead ends: 201 [2025-02-08 06:37:05,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=666, Unknown=0, NotChecked=0, Total=812 [2025-02-08 06:37:05,298 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 121 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:05,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 728 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:37:05,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-08 06:37:05,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 187. [2025-02-08 06:37:05,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 153 states have (on average 1.4444444444444444) internal successors, (221), 185 states have internal predecessors, (221), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:05,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 224 transitions. [2025-02-08 06:37:05,301 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 224 transitions. Word has length 28 [2025-02-08 06:37:05,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:05,302 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 224 transitions. [2025-02-08 06:37:05,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:05,302 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 224 transitions. [2025-02-08 06:37:05,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-08 06:37:05,302 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:05,302 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-08 06:37:05,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 06:37:05,302 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-02-08 06:37:05,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:05,303 INFO L85 PathProgramCache]: Analyzing trace with hash -512834521, now seen corresponding path program 1 times [2025-02-08 06:37:05,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:05,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885191799] [2025-02-08 06:37:05,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:05,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:05,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 06:37:05,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 06:37:05,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:05,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:05,348 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-08 06:37:05,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:05,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885191799] [2025-02-08 06:37:05,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885191799] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:37:05,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:37:05,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:37:05,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472329906] [2025-02-08 06:37:05,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:37:05,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:37:05,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:05,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:37:05,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:37:05,349 INFO L87 Difference]: Start difference. First operand 187 states and 224 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-08 06:37:05,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:05,366 INFO L93 Difference]: Finished difference Result 186 states and 222 transitions. [2025-02-08 06:37:05,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:37:05,366 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-08 06:37:05,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:05,367 INFO L225 Difference]: With dead ends: 186 [2025-02-08 06:37:05,367 INFO L226 Difference]: Without dead ends: 186 [2025-02-08 06:37:05,367 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-08 06:37:05,367 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 41 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:05,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 178 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:37:05,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-02-08 06:37:05,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-02-08 06:37:05,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 153 states have (on average 1.4379084967320261) internal successors, (220), 184 states have internal predecessors, (220), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:05,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 222 transitions. [2025-02-08 06:37:05,370 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 222 transitions. Word has length 34 [2025-02-08 06:37:05,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:05,371 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 222 transitions. [2025-02-08 06:37:05,371 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-08 06:37:05,371 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 222 transitions. [2025-02-08 06:37:05,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 06:37:05,371 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:05,371 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] [2025-02-08 06:37:05,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 06:37:05,372 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-02-08 06:37:05,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:05,372 INFO L85 PathProgramCache]: Analyzing trace with hash -336143616, now seen corresponding path program 1 times [2025-02-08 06:37:05,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:05,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785588994] [2025-02-08 06:37:05,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:05,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:05,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:37:05,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:37:05,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:05,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:05,517 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-08 06:37:05,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:05,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785588994] [2025-02-08 06:37:05,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785588994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:37:05,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:37:05,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:37:05,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89405382] [2025-02-08 06:37:05,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:37:05,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:37:05,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:05,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:37:05,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:37:05,522 INFO L87 Difference]: Start difference. First operand 186 states and 222 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-08 06:37:05,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:05,647 INFO L93 Difference]: Finished difference Result 197 states and 225 transitions. [2025-02-08 06:37:05,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:37:05,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-08 06:37:05,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:05,648 INFO L225 Difference]: With dead ends: 197 [2025-02-08 06:37:05,648 INFO L226 Difference]: Without dead ends: 197 [2025-02-08 06:37:05,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:37:05,653 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 106 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:05,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 234 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:37:05,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-08 06:37:05,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2025-02-08 06:37:05,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 155 states have (on average 1.4322580645161291) internal successors, (222), 186 states have internal predecessors, (222), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:05,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 224 transitions. [2025-02-08 06:37:05,661 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 224 transitions. Word has length 35 [2025-02-08 06:37:05,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:05,661 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 224 transitions. [2025-02-08 06:37:05,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-08 06:37:05,661 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 224 transitions. [2025-02-08 06:37:05,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 06:37:05,661 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:05,662 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] [2025-02-08 06:37:05,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 06:37:05,662 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-02-08 06:37:05,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:05,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1809248136, now seen corresponding path program 1 times [2025-02-08 06:37:05,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:05,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902374248] [2025-02-08 06:37:05,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:05,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:05,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 06:37:05,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:37:05,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:05,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:06,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:37:06,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:06,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902374248] [2025-02-08 06:37:06,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902374248] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:37:06,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127607479] [2025-02-08 06:37:06,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:06,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:37:06,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:37:06,277 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-08 06:37:06,285 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-08 06:37:06,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 06:37:06,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:37:06,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:06,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:06,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-08 06:37:06,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:37:06,444 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-08 06:37:06,493 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:37:06,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:37:06,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:37:06,595 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-08 06:37:06,595 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 32 treesize of output 23 [2025-02-08 06:37:06,616 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-08 06:37:06,616 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 32 treesize of output 23 [2025-02-08 06:37:06,642 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:37:06,642 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-08 06:37:06,686 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-02-08 06:37:06,687 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 1 case distinctions, treesize of input 39 treesize of output 19 [2025-02-08 06:37:06,855 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2025-02-08 06:37:06,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 43 [2025-02-08 06:37:06,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-02-08 06:37:06,951 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2025-02-08 06:37:06,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 50 [2025-02-08 06:37:07,010 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2025-02-08 06:37:07,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 50 [2025-02-08 06:37:07,121 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-08 06:37:07,122 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 36 treesize of output 22 [2025-02-08 06:37:07,204 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 24 treesize of output 12 [2025-02-08 06:37:07,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:37:07,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:37:07,401 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_51| Int) (v_ArrVal_785 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~bcki~0#1.offset_51| 0) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_785) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_51|) 0)) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_51|))) is different from false [2025-02-08 06:37:07,413 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_51| Int) (v_ArrVal_785 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_785) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_51|) 0)) (< |v_ULTIMATE.start_main_~bcki~0#1.offset_51| 0) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_51|))) is different from false [2025-02-08 06:37:07,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:37:07,537 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2025-02-08 06:37:07,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:37:07,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-02-08 06:37:07,748 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:37:07,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:37:07,755 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 33 treesize of output 33 [2025-02-08 06:37:07,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:37:07,764 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 29 treesize of output 33 [2025-02-08 06:37:07,772 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 06:37:07,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-02-08 06:37:07,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:37:07,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127607479] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:37:07,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:37:07,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 15] total 37 [2025-02-08 06:37:07,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985342758] [2025-02-08 06:37:07,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:37:07,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-08 06:37:07,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:07,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-08 06:37:07,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1064, Unknown=15, NotChecked=138, Total=1406 [2025-02-08 06:37:07,937 INFO L87 Difference]: Start difference. First operand 188 states and 224 transitions. Second operand has 38 states, 38 states have (on average 2.5789473684210527) internal successors, (98), 37 states have internal predecessors, (98), 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-08 06:37:08,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:08,977 INFO L93 Difference]: Finished difference Result 237 states and 289 transitions. [2025-02-08 06:37:08,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 06:37:08,978 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.5789473684210527) internal successors, (98), 37 states have internal predecessors, (98), 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 38 [2025-02-08 06:37:08,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:08,979 INFO L225 Difference]: With dead ends: 237 [2025-02-08 06:37:08,979 INFO L226 Difference]: Without dead ends: 237 [2025-02-08 06:37:08,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=318, Invalid=1837, Unknown=15, NotChecked=182, Total=2352 [2025-02-08 06:37:08,983 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 221 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 290 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:08,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1299 Invalid, 1514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1200 Invalid, 0 Unknown, 290 Unchecked, 0.7s Time] [2025-02-08 06:37:08,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-02-08 06:37:08,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 198. [2025-02-08 06:37:08,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 165 states have (on average 1.406060606060606) internal successors, (232), 196 states have internal predecessors, (232), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:08,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 234 transitions. [2025-02-08 06:37:08,989 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 234 transitions. Word has length 38 [2025-02-08 06:37:08,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:08,989 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 234 transitions. [2025-02-08 06:37:08,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.5789473684210527) internal successors, (98), 37 states have internal predecessors, (98), 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-08 06:37:08,990 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 234 transitions. [2025-02-08 06:37:08,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 06:37:08,991 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:08,991 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] [2025-02-08 06:37:08,999 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-08 06:37:09,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-08 06:37:09,192 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-02-08 06:37:09,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:09,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1809249831, now seen corresponding path program 1 times [2025-02-08 06:37:09,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:09,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467331029] [2025-02-08 06:37:09,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:09,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:09,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 06:37:09,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:37:09,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:09,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:09,720 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-08 06:37:09,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:09,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467331029] [2025-02-08 06:37:09,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467331029] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:37:09,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285140163] [2025-02-08 06:37:09,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:09,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:37:09,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:37:09,724 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-08 06:37:09,728 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-08 06:37:09,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 06:37:09,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:37:09,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:09,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:09,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-08 06:37:09,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:37:09,845 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-08 06:37:09,864 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 06:37:09,864 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-08 06:37:09,894 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-08 06:37:09,989 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-08 06:37:09,989 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-08 06:37:10,005 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-08 06:37:10,006 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-08 06:37:10,039 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2025-02-08 06:37:10,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2025-02-08 06:37:10,102 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-02-08 06:37:10,102 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 1 case distinctions, treesize of input 52 treesize of output 28 [2025-02-08 06:37:10,266 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2025-02-08 06:37:10,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 55 [2025-02-08 06:37:10,311 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2025-02-08 06:37:10,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 55 [2025-02-08 06:37:10,340 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-02-08 06:37:10,341 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 64 [2025-02-08 06:37:10,551 INFO L349 Elim1Store]: treesize reduction 66, result has 24.1 percent of original size [2025-02-08 06:37:10,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 46 [2025-02-08 06:37:10,823 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-08 06:37:10,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 29 [2025-02-08 06:37:10,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-02-08 06:37:10,965 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-08 06:37:10,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:37:11,375 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base|))) (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_ArrVal_932 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_57| Int)) (or (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse0 |ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_932) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_57|)) 1) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_57|) (< |v_ULTIMATE.start_main_~bcki~0#1.offset_57| 0))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_ArrVal_932 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_57| Int)) (or (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_57|) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse0 |ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_932) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_57|) |c_ULTIMATE.start_main_~bucket~0#1.base|)) (< |v_ULTIMATE.start_main_~bcki~0#1.offset_57| 0))))) is different from false [2025-02-08 06:37:11,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:37:11,458 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2025-02-08 06:37:11,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:37:11,470 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-02-08 06:37:11,480 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_ArrVal_932 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_57| Int)) (let ((.cse0 (select v_arrayElimArr_3 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_57|) (< |v_ULTIMATE.start_main_~bcki~0#1.offset_57| 0) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_3) .cse0 v_ArrVal_932) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_57|) |c_ULTIMATE.start_main_~bucket~0#1.base|)) (not (= (select |c_#valid| .cse0) 0))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_ArrVal_932 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_57| Int)) (let ((.cse1 (select v_arrayElimArr_4 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (= (select (store |c_#valid| .cse1 1) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_4) .cse1 v_ArrVal_932) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_57|)) 1) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_57|) (not (= (select |c_#valid| .cse1) 0)) (< |v_ULTIMATE.start_main_~bcki~0#1.offset_57| 0))))) is different from false [2025-02-08 06:37:11,519 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_ArrVal_932 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_57| Int)) (let ((.cse0 (select v_arrayElimArr_3 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_57|) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_3) .cse0 v_ArrVal_932) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_57|))) (< |v_ULTIMATE.start_main_~bcki~0#1.offset_57| 0) (not (= (select |c_#valid| .cse0) 0))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_ArrVal_932 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_57| Int)) (let ((.cse1 (select v_arrayElimArr_4 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (= (select (store |c_#valid| .cse1 1) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_4) .cse1 v_ArrVal_932) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_57|)) 1) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_57|) (not (= (select |c_#valid| .cse1) 0)) (< |v_ULTIMATE.start_main_~bcki~0#1.offset_57| 0))))) is different from false [2025-02-08 06:37:12,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:37:12,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-02-08 06:37:12,725 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:37:12,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:37:12,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2025-02-08 06:37:12,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:37:12,739 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 29 treesize of output 33 [2025-02-08 06:37:12,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:37:12,772 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 30 treesize of output 31 [2025-02-08 06:37:12,774 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:37:12,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:37:12,780 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 44 treesize of output 44 [2025-02-08 06:37:12,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:37:12,788 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 40 treesize of output 40 [2025-02-08 06:37:17,809 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-08 06:37:17,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285140163] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:37:17,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:37:17,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 44 [2025-02-08 06:37:17,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374052490] [2025-02-08 06:37:17,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:37:17,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-02-08 06:37:17,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:17,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-02-08 06:37:17,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1539, Unknown=20, NotChecked=252, Total=2070 [2025-02-08 06:37:17,812 INFO L87 Difference]: Start difference. First operand 198 states and 234 transitions. Second operand has 46 states, 45 states have (on average 2.3777777777777778) internal successors, (107), 45 states have internal predecessors, (107), 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-08 06:37:20,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:20,183 INFO L93 Difference]: Finished difference Result 230 states and 268 transitions. [2025-02-08 06:37:20,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 06:37:20,184 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.3777777777777778) internal successors, (107), 45 states have internal predecessors, (107), 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 38 [2025-02-08 06:37:20,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:20,184 INFO L225 Difference]: With dead ends: 230 [2025-02-08 06:37:20,184 INFO L226 Difference]: Without dead ends: 230 [2025-02-08 06:37:20,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=323, Invalid=2019, Unknown=22, NotChecked=288, Total=2652 [2025-02-08 06:37:20,185 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 134 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 2121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 554 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:20,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1206 Invalid, 2121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1547 Invalid, 0 Unknown, 554 Unchecked, 1.4s Time] [2025-02-08 06:37:20,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-02-08 06:37:20,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 199. [2025-02-08 06:37:20,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 166 states have (on average 1.4096385542168675) internal successors, (234), 197 states have internal predecessors, (234), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:20,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 236 transitions. [2025-02-08 06:37:20,189 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 236 transitions. Word has length 38 [2025-02-08 06:37:20,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:20,189 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 236 transitions. [2025-02-08 06:37:20,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.3777777777777778) internal successors, (107), 45 states have internal predecessors, (107), 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-08 06:37:20,190 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 236 transitions. [2025-02-08 06:37:20,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 06:37:20,190 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:20,190 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] [2025-02-08 06:37:20,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 06:37:20,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 06:37:20,394 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-02-08 06:37:20,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:20,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1809249832, now seen corresponding path program 1 times [2025-02-08 06:37:20,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:20,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136772108] [2025-02-08 06:37:20,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:20,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:20,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 06:37:20,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:37:20,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:20,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:21,232 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-08 06:37:21,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:21,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136772108] [2025-02-08 06:37:21,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136772108] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:37:21,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475867694] [2025-02-08 06:37:21,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:21,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:37:21,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:37:21,235 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-08 06:37:21,237 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-08 06:37:21,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 06:37:21,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:37:21,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:21,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:21,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-02-08 06:37:21,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:37:21,353 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-08 06:37:21,381 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:37:21,381 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-08 06:37:21,388 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-08 06:37:21,412 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-08 06:37:21,417 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-08 06:37:21,534 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:37:21,534 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-08 06:37:21,555 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-08 06:37:21,555 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-08 06:37:21,599 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:37:21,599 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-08 06:37:21,615 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-08 06:37:21,615 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-08 06:37:21,660 INFO L349 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2025-02-08 06:37:21,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2025-02-08 06:37:21,679 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:37:21,679 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-08 06:37:21,744 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-02-08 06:37:21,744 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 1 case distinctions, treesize of input 40 treesize of output 20 [2025-02-08 06:37:21,757 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-08 06:37:21,968 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2025-02-08 06:37:21,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 73 [2025-02-08 06:37:21,984 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-08 06:37:21,985 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 42 treesize of output 42 [2025-02-08 06:37:21,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-08 06:37:22,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2025-02-08 06:37:22,144 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2025-02-08 06:37:22,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 86 [2025-02-08 06:37:22,172 INFO L349 Elim1Store]: treesize reduction 36, result has 39.0 percent of original size [2025-02-08 06:37:22,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 75 [2025-02-08 06:37:22,227 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 19 treesize of output 13 [2025-02-08 06:37:22,242 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-08 06:37:22,307 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2025-02-08 06:37:22,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 86 [2025-02-08 06:37:22,336 INFO L349 Elim1Store]: treesize reduction 36, result has 39.0 percent of original size [2025-02-08 06:37:22,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 75 [2025-02-08 06:37:22,369 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-08 06:37:22,406 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 23 treesize of output 17 [2025-02-08 06:37:22,668 INFO L349 Elim1Store]: treesize reduction 66, result has 24.1 percent of original size [2025-02-08 06:37:22,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 56 [2025-02-08 06:37:22,681 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2025-02-08 06:37:22,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 54 [2025-02-08 06:37:23,051 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-08 06:37:23,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 39 [2025-02-08 06:37:23,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2025-02-08 06:37:23,164 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-08 06:37:23,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:37:24,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:37:24,107 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2025-02-08 06:37:24,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:37:24,113 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 43 [2025-02-08 06:37:24,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:37:24,130 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2025-02-08 06:37:24,143 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_63| Int) (|ULTIMATE.start_main_~bcki~0#1.offset| Int) (|v_ULTIMATE.start_main_#t~malloc4#1.base_14| Int) (v_ArrVal_1087 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 |ULTIMATE.start_main_~bcki~0#1.offset|) 0)) (< 0 (+ 5 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_9) |v_ULTIMATE.start_main_#t~malloc4#1.base_14| v_ArrVal_1087) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_63|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_14|) 0)) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_63|) (< |v_ULTIMATE.start_main_~bcki~0#1.offset_63| 0))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (|v_ULTIMATE.start_main_~bcki~0#1.offset_63| Int) (v_arrayElimArr_8 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1087 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_7 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (not (= (select v_arrayElimArr_8 |ULTIMATE.start_main_~bcki~0#1.offset|) 0)) (< |c_ULTIMATE.start_main_~bucket~0#1.offset| |v_ULTIMATE.start_main_~bcki~0#1.offset_63|) (not (= (select |c_#valid| .cse0) 0)) (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_8) .cse0 v_ArrVal_1087) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_63|) 7) (select (store |c_#length| .cse0 12) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_7) .cse0 v_ArrVal_1088) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_63|))) (< |v_ULTIMATE.start_main_~bcki~0#1.offset_63| 0))))) is different from false [2025-02-08 06:37:40,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:37:40,771 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 116 treesize of output 109 [2025-02-08 06:37:40,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:37:40,779 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 100 treesize of output 101 [2025-02-08 06:37:40,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:37:40,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 402 treesize of output 410 [2025-02-08 06:37:40,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:37:40,828 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 978 treesize of output 950 [2025-02-08 06:37:40,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:37:40,859 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 189 treesize of output 182 [2025-02-08 06:37:40,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:37:40,874 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 173 treesize of output 178 [2025-02-08 06:37:40,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:37:40,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 176 treesize of output 194 [2025-02-08 06:37:40,912 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 165 treesize of output 161 [2025-02-08 06:37:40,919 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 161 treesize of output 157 [2025-02-08 06:37:40,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 153 [2025-02-08 06:37:40,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:37:40,942 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 153 treesize of output 158 [2025-02-08 06:37:53,311 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-08 06:37:53,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475867694] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:37:53,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:37:53,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 44 [2025-02-08 06:37:53,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023845233] [2025-02-08 06:37:53,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:37:53,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-02-08 06:37:53,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:53,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-02-08 06:37:53,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1756, Unknown=11, NotChecked=86, Total=2070 [2025-02-08 06:37:53,314 INFO L87 Difference]: Start difference. First operand 199 states and 236 transitions. Second operand has 46 states, 45 states have (on average 2.533333333333333) internal successors, (114), 45 states have internal predecessors, (114), 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-08 06:38:31,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 06:38:37,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:38:37,159 INFO L93 Difference]: Finished difference Result 234 states and 279 transitions. [2025-02-08 06:38:37,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 06:38:37,160 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.533333333333333) internal successors, (114), 45 states have internal predecessors, (114), 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 38 [2025-02-08 06:38:37,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:38:37,161 INFO L225 Difference]: With dead ends: 234 [2025-02-08 06:38:37,161 INFO L226 Difference]: Without dead ends: 234 [2025-02-08 06:38:37,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 63.4s TimeCoverageRelationStatistics Valid=439, Invalid=3208, Unknown=17, NotChecked=118, Total=3782 [2025-02-08 06:38:37,162 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 233 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 1771 mSolverCounterSat, 41 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 1996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1771 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 182 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2025-02-08 06:38:37,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 1312 Invalid, 1996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1771 Invalid, 2 Unknown, 182 Unchecked, 9.8s Time] [2025-02-08 06:38:37,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-02-08 06:38:37,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 222. [2025-02-08 06:38:37,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 192 states have (on average 1.4114583333333333) internal successors, (271), 220 states have internal predecessors, (271), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:38:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 273 transitions. [2025-02-08 06:38:37,167 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 273 transitions. Word has length 38 [2025-02-08 06:38:37,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:38:37,167 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 273 transitions. [2025-02-08 06:38:37,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.533333333333333) internal successors, (114), 45 states have internal predecessors, (114), 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-08 06:38:37,167 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 273 transitions. [2025-02-08 06:38:37,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 06:38:37,168 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:38:37,168 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] [2025-02-08 06:38:37,175 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-08 06:38:37,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:38:37,372 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 65 more)] === [2025-02-08 06:38:37,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:38:37,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1225197609, now seen corresponding path program 1 times [2025-02-08 06:38:37,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:38:37,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759576860] [2025-02-08 06:38:37,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:38:37,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:38:37,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:38:37,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:38:37,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:38:37,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:38:38,946 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-08 06:38:38,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:38:38,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759576860] [2025-02-08 06:38:38,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759576860] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:38:38,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045877616] [2025-02-08 06:38:38,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:38:38,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:38:38,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:38:38,948 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-08 06:38:38,950 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-08 06:38:39,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:38:39,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:38:39,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:38:39,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:38:39,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-08 06:38:39,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:38:39,080 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-08 06:38:39,178 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 06:38:39,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16