./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:52:00,547 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:52:00,599 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 11:52:00,603 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:52:00,605 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:52:00,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:52:00,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:52:00,626 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:52:00,627 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:52:00,627 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:52:00,627 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:52:00,627 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:52:00,627 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:52:00,627 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:52:00,627 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:52:00,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:52:00,627 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:52:00,627 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:52:00,627 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:52:00,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:52:00,627 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:52:00,628 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:52:00,628 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 11:52:00,628 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:52:00,628 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:52:00,628 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:52:00,628 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:52:00,628 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:52:00,628 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:52:00,628 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:52:00,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:52:00,628 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:52:00,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:52:00,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:52:00,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:52:00,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:52:00,628 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:52:00,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:52:00,629 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:52:00,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:52:00,629 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:52:00,629 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:52:00,629 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 [2025-03-17 11:52:00,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:52:00,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:52:00,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:52:00,843 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:52:00,843 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:52:00,843 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2025-03-17 11:52:01,978 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/399a07eb1/56543f777e814c9eb6890d1b0cdb7854/FLAGe23d3c758 [2025-03-17 11:52:02,203 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:52:02,203 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2025-03-17 11:52:02,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/399a07eb1/56543f777e814c9eb6890d1b0cdb7854/FLAGe23d3c758 [2025-03-17 11:52:02,553 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/399a07eb1/56543f777e814c9eb6890d1b0cdb7854 [2025-03-17 11:52:02,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:52:02,555 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:52:02,556 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:52:02,556 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:52:02,559 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:52:02,560 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:52:02" (1/1) ... [2025-03-17 11:52:02,560 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@321e4ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:52:02, skipping insertion in model container [2025-03-17 11:52:02,560 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:52:02" (1/1) ... [2025-03-17 11:52:02,571 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:52:02,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:52:02,668 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:52:02,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:52:02,696 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:52:02,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:52:02 WrapperNode [2025-03-17 11:52:02,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:52:02,698 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:52:02,698 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:52:02,698 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:52:02,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:52:02" (1/1) ... [2025-03-17 11:52:02,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:52:02" (1/1) ... [2025-03-17 11:52:02,721 INFO L138 Inliner]: procedures = 19, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2025-03-17 11:52:02,722 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:52:02,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:52:02,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:52:02,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:52:02,727 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:52:02" (1/1) ... [2025-03-17 11:52:02,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:52:02" (1/1) ... [2025-03-17 11:52:02,729 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:52:02" (1/1) ... [2025-03-17 11:52:02,736 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-17 11:52:02,737 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:52:02" (1/1) ... [2025-03-17 11:52:02,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:52:02" (1/1) ... [2025-03-17 11:52:02,740 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:52:02" (1/1) ... [2025-03-17 11:52:02,741 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:52:02" (1/1) ... [2025-03-17 11:52:02,742 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:52:02" (1/1) ... [2025-03-17 11:52:02,742 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:52:02" (1/1) ... [2025-03-17 11:52:02,743 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:52:02,745 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:52:02,745 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:52:02,745 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:52:02,747 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:52:02" (1/1) ... [2025-03-17 11:52:02,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:52:02,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:52:02,768 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:52:02,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:52:02,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:52:02,789 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 11:52:02,789 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 11:52:02,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 11:52:02,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 11:52:02,790 INFO L130 BoogieDeclarations]: Found specification of procedure check [2025-03-17 11:52:02,790 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2025-03-17 11:52:02,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:52:02,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:52:02,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:52:02,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 11:52:02,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 11:52:02,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 11:52:02,791 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 11:52:02,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:52:02,857 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:52:02,859 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:52:03,061 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-03-17 11:52:03,061 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:52:03,071 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:52:03,072 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:52:03,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:52:03 BoogieIcfgContainer [2025-03-17 11:52:03,072 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:52:03,073 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:52:03,073 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:52:03,076 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:52:03,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:52:02" (1/3) ... [2025-03-17 11:52:03,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337f9449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:52:03, skipping insertion in model container [2025-03-17 11:52:03,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:52:02" (2/3) ... [2025-03-17 11:52:03,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337f9449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:52:03, skipping insertion in model container [2025-03-17 11:52:03,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:52:03" (3/3) ... [2025-03-17 11:52:03,080 INFO L128 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2025-03-17 11:52:03,091 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:52:03,092 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elimination_max_rec_onepoint.c that has 4 procedures, 62 locations, 1 initial locations, 0 loop locations, and 17 error locations. [2025-03-17 11:52:03,117 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:52:03,123 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;@3f3021ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:52:03,124 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-17 11:52:03,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 50 states have internal predecessors, (54), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 11:52:03,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 11:52:03,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:03,134 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:03,134 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-17 11:52:03,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:03,138 INFO L85 PathProgramCache]: Analyzing trace with hash 820793634, now seen corresponding path program 1 times [2025-03-17 11:52:03,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:03,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214411464] [2025-03-17 11:52:03,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:03,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:03,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:52:03,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:52:03,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:03,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:03,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:52:03,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:03,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214411464] [2025-03-17 11:52:03,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214411464] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:03,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577755231] [2025-03-17 11:52:03,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:03,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:03,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:52:03,254 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:52:03,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:52:03,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:52:03,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:52:03,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:03,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:03,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 11:52:03,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:52:03,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:52:03,343 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:52:03,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577755231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:52:03,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:52:03,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 11:52:03,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856954409] [2025-03-17 11:52:03,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:52:03,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:52:03,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:03,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:52:03,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:52:03,366 INFO L87 Difference]: Start difference. First operand has 62 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 50 states have internal predecessors, (54), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:52:03,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:03,376 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2025-03-17 11:52:03,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:52:03,378 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2025-03-17 11:52:03,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:03,382 INFO L225 Difference]: With dead ends: 62 [2025-03-17 11:52:03,383 INFO L226 Difference]: Without dead ends: 60 [2025-03-17 11:52:03,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:52:03,386 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:03,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:52:03,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-17 11:52:03,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-17 11:52:03,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 32 states have (on average 1.5625) internal successors, (50), 48 states have internal predecessors, (50), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 11:52:03,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2025-03-17 11:52:03,411 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 20 [2025-03-17 11:52:03,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:03,411 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2025-03-17 11:52:03,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:52:03,411 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2025-03-17 11:52:03,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 11:52:03,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:03,412 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:03,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 11:52:03,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 11:52:03,619 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-17 11:52:03,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:03,619 INFO L85 PathProgramCache]: Analyzing trace with hash 377151972, now seen corresponding path program 1 times [2025-03-17 11:52:03,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:03,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401942753] [2025-03-17 11:52:03,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:03,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:03,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:52:03,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:52:03,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:03,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:03,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:52:03,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:03,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401942753] [2025-03-17 11:52:03,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401942753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:52:03,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:52:03,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:52:03,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062689474] [2025-03-17 11:52:03,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:52:03,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:52:03,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:03,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:52:03,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:52:03,903 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:52:04,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:04,018 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2025-03-17 11:52:04,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:52:04,019 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-03-17 11:52:04,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:04,020 INFO L225 Difference]: With dead ends: 104 [2025-03-17 11:52:04,020 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 11:52:04,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:52:04,021 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 42 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:04,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 304 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:52:04,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 11:52:04,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 83. [2025-03-17 11:52:04,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 65 states have internal predecessors, (76), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 11:52:04,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2025-03-17 11:52:04,029 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 102 transitions. Word has length 20 [2025-03-17 11:52:04,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:04,030 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 102 transitions. [2025-03-17 11:52:04,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:52:04,030 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2025-03-17 11:52:04,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 11:52:04,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:04,030 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:04,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:52:04,031 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-17 11:52:04,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:04,031 INFO L85 PathProgramCache]: Analyzing trace with hash 375606333, now seen corresponding path program 1 times [2025-03-17 11:52:04,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:04,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77904359] [2025-03-17 11:52:04,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:04,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:04,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:52:04,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:52:04,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:04,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:04,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:52:04,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:04,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77904359] [2025-03-17 11:52:04,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77904359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:52:04,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:52:04,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:52:04,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45251775] [2025-03-17 11:52:04,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:52:04,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:52:04,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:04,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:52:04,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:52:04,330 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 11:52:04,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:04,513 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2025-03-17 11:52:04,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:52:04,515 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2025-03-17 11:52:04,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:04,517 INFO L225 Difference]: With dead ends: 89 [2025-03-17 11:52:04,517 INFO L226 Difference]: Without dead ends: 89 [2025-03-17 11:52:04,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:52:04,529 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 13 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:04,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 321 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:52:04,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-17 11:52:04,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2025-03-17 11:52:04,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 51 states have (on average 1.5686274509803921) internal successors, (80), 68 states have internal predecessors, (80), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-17 11:52:04,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2025-03-17 11:52:04,539 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 20 [2025-03-17 11:52:04,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:04,539 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 108 transitions. [2025-03-17 11:52:04,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 11:52:04,539 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2025-03-17 11:52:04,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 11:52:04,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:04,539 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:04,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:52:04,540 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-17 11:52:04,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:04,540 INFO L85 PathProgramCache]: Analyzing trace with hash 375606332, now seen corresponding path program 1 times [2025-03-17 11:52:04,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:04,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98089626] [2025-03-17 11:52:04,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:04,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:04,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:52:04,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:52:04,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:04,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:04,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:52:04,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:04,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98089626] [2025-03-17 11:52:04,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98089626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:52:04,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:52:04,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:52:04,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804315543] [2025-03-17 11:52:04,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:52:04,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:52:04,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:04,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:52:04,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:52:04,569 INFO L87 Difference]: Start difference. First operand 87 states and 108 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 11:52:04,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:04,597 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2025-03-17 11:52:04,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:52:04,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2025-03-17 11:52:04,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:04,598 INFO L225 Difference]: With dead ends: 84 [2025-03-17 11:52:04,599 INFO L226 Difference]: Without dead ends: 84 [2025-03-17 11:52:04,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:52:04,599 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:04,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 92 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:52:04,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-17 11:52:04,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-17 11:52:04,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 65 states have internal predecessors, (76), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-17 11:52:04,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 104 transitions. [2025-03-17 11:52:04,609 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 104 transitions. Word has length 20 [2025-03-17 11:52:04,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:04,609 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 104 transitions. [2025-03-17 11:52:04,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 11:52:04,610 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2025-03-17 11:52:04,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 11:52:04,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:04,610 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:04,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:52:04,611 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-17 11:52:04,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:04,611 INFO L85 PathProgramCache]: Analyzing trace with hash 180431642, now seen corresponding path program 1 times [2025-03-17 11:52:04,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:04,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097638390] [2025-03-17 11:52:04,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:04,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:04,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 11:52:04,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 11:52:04,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:04,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:04,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:52:04,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:04,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097638390] [2025-03-17 11:52:04,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097638390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:52:04,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:52:04,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:52:04,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54673167] [2025-03-17 11:52:04,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:52:04,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:52:04,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:04,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:52:04,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:52:04,716 INFO L87 Difference]: Start difference. First operand 84 states and 104 transitions. Second operand has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 11:52:04,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:04,806 INFO L93 Difference]: Finished difference Result 113 states and 146 transitions. [2025-03-17 11:52:04,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:52:04,807 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2025-03-17 11:52:04,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:04,808 INFO L225 Difference]: With dead ends: 113 [2025-03-17 11:52:04,808 INFO L226 Difference]: Without dead ends: 113 [2025-03-17 11:52:04,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:52:04,810 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 28 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:04,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 325 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:52:04,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-17 11:52:04,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 85. [2025-03-17 11:52:04,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 66 states have internal predecessors, (77), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-17 11:52:04,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 105 transitions. [2025-03-17 11:52:04,819 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 105 transitions. Word has length 22 [2025-03-17 11:52:04,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:04,819 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 105 transitions. [2025-03-17 11:52:04,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 11:52:04,820 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2025-03-17 11:52:04,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 11:52:04,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:04,820 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:04,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:52:04,820 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-17 11:52:04,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:04,821 INFO L85 PathProgramCache]: Analyzing trace with hash 265416430, now seen corresponding path program 1 times [2025-03-17 11:52:04,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:04,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301630122] [2025-03-17 11:52:04,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:04,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:04,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 11:52:04,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 11:52:04,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:04,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:05,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:52:05,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:05,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301630122] [2025-03-17 11:52:05,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301630122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:52:05,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:52:05,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 11:52:05,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936206465] [2025-03-17 11:52:05,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:52:05,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:52:05,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:05,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:52:05,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:52:05,016 INFO L87 Difference]: Start difference. First operand 85 states and 105 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 11:52:05,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:05,142 INFO L93 Difference]: Finished difference Result 89 states and 108 transitions. [2025-03-17 11:52:05,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:52:05,143 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2025-03-17 11:52:05,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:05,144 INFO L225 Difference]: With dead ends: 89 [2025-03-17 11:52:05,144 INFO L226 Difference]: Without dead ends: 89 [2025-03-17 11:52:05,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:52:05,144 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 19 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:05,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 420 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:52:05,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-17 11:52:05,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-17 11:52:05,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 69 states have internal predecessors, (80), 13 states have call successors, (13), 6 states have call predecessors, (13), 7 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-17 11:52:05,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2025-03-17 11:52:05,155 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 27 [2025-03-17 11:52:05,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:05,156 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2025-03-17 11:52:05,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 11:52:05,156 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2025-03-17 11:52:05,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 11:52:05,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:05,156 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:05,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:52:05,156 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-17 11:52:05,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:05,157 INFO L85 PathProgramCache]: Analyzing trace with hash 758030545, now seen corresponding path program 1 times [2025-03-17 11:52:05,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:05,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295657203] [2025-03-17 11:52:05,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:05,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:05,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 11:52:05,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 11:52:05,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:05,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:05,363 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:52:05,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:05,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295657203] [2025-03-17 11:52:05,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295657203] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:05,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448669318] [2025-03-17 11:52:05,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:05,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:05,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:52:05,367 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:52:05,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:52:05,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 11:52:05,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 11:52:05,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:05,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:05,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 11:52:05,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:52:05,474 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 10 treesize of output 9 [2025-03-17 11:52:05,868 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:52:05,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:52:06,111 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:52:06,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448669318] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:52:06,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:52:06,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 20 [2025-03-17 11:52:06,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001111267] [2025-03-17 11:52:06,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:52:06,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 11:52:06,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:06,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 11:52:06,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-03-17 11:52:06,113 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand has 21 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 7 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-17 11:52:07,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:07,063 INFO L93 Difference]: Finished difference Result 150 states and 179 transitions. [2025-03-17 11:52:07,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 11:52:07,064 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 7 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) Word has length 28 [2025-03-17 11:52:07,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:07,065 INFO L225 Difference]: With dead ends: 150 [2025-03-17 11:52:07,065 INFO L226 Difference]: Without dead ends: 150 [2025-03-17 11:52:07,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=199, Invalid=1061, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 11:52:07,066 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 196 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:07,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 424 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 11:52:07,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-17 11:52:07,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 112. [2025-03-17 11:52:07,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 86 states have internal predecessors, (104), 19 states have call successors, (19), 8 states have call predecessors, (19), 9 states have return successors, (21), 17 states have call predecessors, (21), 19 states have call successors, (21) [2025-03-17 11:52:07,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 144 transitions. [2025-03-17 11:52:07,075 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 144 transitions. Word has length 28 [2025-03-17 11:52:07,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:07,076 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 144 transitions. [2025-03-17 11:52:07,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 7 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-17 11:52:07,076 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 144 transitions. [2025-03-17 11:52:07,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 11:52:07,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:07,077 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:07,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 11:52:07,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-17 11:52:07,278 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-17 11:52:07,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:07,278 INFO L85 PathProgramCache]: Analyzing trace with hash 758030544, now seen corresponding path program 1 times [2025-03-17 11:52:07,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:07,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612816066] [2025-03-17 11:52:07,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:07,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:07,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 11:52:07,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 11:52:07,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:07,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:07,334 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 11:52:07,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:07,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612816066] [2025-03-17 11:52:07,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612816066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:52:07,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:52:07,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:52:07,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026569508] [2025-03-17 11:52:07,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:52:07,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:52:07,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:07,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:52:07,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:52:07,335 INFO L87 Difference]: Start difference. First operand 112 states and 144 transitions. Second operand has 5 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 11:52:07,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:07,395 INFO L93 Difference]: Finished difference Result 112 states and 139 transitions. [2025-03-17 11:52:07,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:52:07,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2025-03-17 11:52:07,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:07,396 INFO L225 Difference]: With dead ends: 112 [2025-03-17 11:52:07,396 INFO L226 Difference]: Without dead ends: 112 [2025-03-17 11:52:07,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:52:07,396 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 36 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:07,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 100 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:52:07,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-17 11:52:07,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2025-03-17 11:52:07,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 82 states have internal predecessors, (92), 19 states have call successors, (19), 8 states have call predecessors, (19), 9 states have return successors, (21), 17 states have call predecessors, (21), 19 states have call successors, (21) [2025-03-17 11:52:07,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 132 transitions. [2025-03-17 11:52:07,401 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 132 transitions. Word has length 28 [2025-03-17 11:52:07,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:07,401 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 132 transitions. [2025-03-17 11:52:07,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 11:52:07,403 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2025-03-17 11:52:07,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 11:52:07,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:07,404 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:07,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:52:07,404 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting checkErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-17 11:52:07,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:07,404 INFO L85 PathProgramCache]: Analyzing trace with hash 2024110398, now seen corresponding path program 1 times [2025-03-17 11:52:07,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:07,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185813340] [2025-03-17 11:52:07,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:07,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:07,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 11:52:07,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 11:52:07,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:07,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:07,660 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:52:07,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:07,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185813340] [2025-03-17 11:52:07,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185813340] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:07,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585413399] [2025-03-17 11:52:07,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:07,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:07,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:52:07,663 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:52:07,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 11:52:07,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 11:52:07,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 11:52:07,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:07,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:07,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 11:52:07,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:52:07,752 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 10 treesize of output 9 [2025-03-17 11:52:08,105 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:52:08,106 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:52:08,384 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:52:08,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585413399] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:52:08,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:52:08,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 23 [2025-03-17 11:52:08,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592479069] [2025-03-17 11:52:08,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:52:08,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 11:52:08,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:08,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 11:52:08,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2025-03-17 11:52:08,386 INFO L87 Difference]: Start difference. First operand 108 states and 132 transitions. Second operand has 24 states, 20 states have (on average 1.85) internal successors, (37), 18 states have internal predecessors, (37), 7 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-17 11:52:09,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:09,352 INFO L93 Difference]: Finished difference Result 132 states and 157 transitions. [2025-03-17 11:52:09,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 11:52:09,353 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 1.85) internal successors, (37), 18 states have internal predecessors, (37), 7 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) Word has length 29 [2025-03-17 11:52:09,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:09,354 INFO L225 Difference]: With dead ends: 132 [2025-03-17 11:52:09,354 INFO L226 Difference]: Without dead ends: 132 [2025-03-17 11:52:09,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=285, Invalid=1521, Unknown=0, NotChecked=0, Total=1806 [2025-03-17 11:52:09,355 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 231 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:09,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 372 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:52:09,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-17 11:52:09,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 106. [2025-03-17 11:52:09,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 80 states have internal predecessors, (88), 19 states have call successors, (19), 8 states have call predecessors, (19), 9 states have return successors, (21), 17 states have call predecessors, (21), 19 states have call successors, (21) [2025-03-17 11:52:09,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 128 transitions. [2025-03-17 11:52:09,360 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 128 transitions. Word has length 29 [2025-03-17 11:52:09,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:09,360 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 128 transitions. [2025-03-17 11:52:09,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 1.85) internal successors, (37), 18 states have internal predecessors, (37), 7 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-17 11:52:09,360 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 128 transitions. [2025-03-17 11:52:09,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 11:52:09,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:09,364 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:09,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 11:52:09,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:09,565 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-17 11:52:09,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:09,565 INFO L85 PathProgramCache]: Analyzing trace with hash -12822387, now seen corresponding path program 1 times [2025-03-17 11:52:09,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:09,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099202173] [2025-03-17 11:52:09,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:09,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:09,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 11:52:09,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 11:52:09,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:09,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:09,590 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:52:09,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:09,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099202173] [2025-03-17 11:52:09,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099202173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:52:09,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:52:09,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:52:09,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041702679] [2025-03-17 11:52:09,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:52:09,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:52:09,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:09,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:52:09,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:52:09,592 INFO L87 Difference]: Start difference. First operand 106 states and 128 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 11:52:09,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:09,611 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2025-03-17 11:52:09,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:52:09,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2025-03-17 11:52:09,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:09,612 INFO L225 Difference]: With dead ends: 105 [2025-03-17 11:52:09,612 INFO L226 Difference]: Without dead ends: 105 [2025-03-17 11:52:09,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:52:09,613 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:09,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 88 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:52:09,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-17 11:52:09,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-17 11:52:09,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 79 states have internal predecessors, (87), 19 states have call successors, (19), 8 states have call predecessors, (19), 9 states have return successors, (21), 17 states have call predecessors, (21), 19 states have call successors, (21) [2025-03-17 11:52:09,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 127 transitions. [2025-03-17 11:52:09,621 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 127 transitions. Word has length 30 [2025-03-17 11:52:09,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:09,621 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 127 transitions. [2025-03-17 11:52:09,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 11:52:09,621 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 127 transitions. [2025-03-17 11:52:09,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 11:52:09,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:09,622 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:09,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:52:09,622 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-17 11:52:09,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:09,625 INFO L85 PathProgramCache]: Analyzing trace with hash 562587083, now seen corresponding path program 1 times [2025-03-17 11:52:09,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:09,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44920334] [2025-03-17 11:52:09,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:09,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:09,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 11:52:09,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 11:52:09,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:09,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:09,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:52:09,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:09,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44920334] [2025-03-17 11:52:09,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44920334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:52:09,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:52:09,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:52:09,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102520326] [2025-03-17 11:52:09,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:52:09,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:52:09,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:09,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:52:09,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:52:09,676 INFO L87 Difference]: Start difference. First operand 105 states and 127 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 11:52:09,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:09,706 INFO L93 Difference]: Finished difference Result 104 states and 126 transitions. [2025-03-17 11:52:09,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:52:09,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2025-03-17 11:52:09,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:09,706 INFO L225 Difference]: With dead ends: 104 [2025-03-17 11:52:09,707 INFO L226 Difference]: Without dead ends: 88 [2025-03-17 11:52:09,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:52:09,707 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:09,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:52:09,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-17 11:52:09,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-17 11:52:09,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 65 states have internal predecessors, (72), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (19), 15 states have call predecessors, (19), 18 states have call successors, (19) [2025-03-17 11:52:09,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2025-03-17 11:52:09,716 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 32 [2025-03-17 11:52:09,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:09,716 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2025-03-17 11:52:09,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 11:52:09,717 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2025-03-17 11:52:09,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 11:52:09,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:09,717 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:09,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:52:09,717 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-17 11:52:09,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:09,718 INFO L85 PathProgramCache]: Analyzing trace with hash -13935831, now seen corresponding path program 1 times [2025-03-17 11:52:09,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:09,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413526862] [2025-03-17 11:52:09,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:09,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:09,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 11:52:09,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 11:52:09,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:09,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:09,850 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 11:52:09,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:09,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413526862] [2025-03-17 11:52:09,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413526862] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:09,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559134515] [2025-03-17 11:52:09,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:09,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:09,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:52:09,852 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:52:09,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 11:52:09,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 11:52:09,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 11:52:09,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:09,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:09,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 11:52:09,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:52:09,972 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 11:52:09,972 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:52:09,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559134515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:52:09,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:52:09,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 12 [2025-03-17 11:52:09,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715709404] [2025-03-17 11:52:09,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:52:09,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:52:09,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:09,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:52:09,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:52:09,973 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 11:52:10,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:10,097 INFO L93 Difference]: Finished difference Result 109 states and 132 transitions. [2025-03-17 11:52:10,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:52:10,098 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2025-03-17 11:52:10,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:10,099 INFO L225 Difference]: With dead ends: 109 [2025-03-17 11:52:10,099 INFO L226 Difference]: Without dead ends: 109 [2025-03-17 11:52:10,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-03-17 11:52:10,099 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 68 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:10,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 231 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:52:10,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-17 11:52:10,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 92. [2025-03-17 11:52:10,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 68 states have internal predecessors, (75), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (19), 15 states have call predecessors, (19), 18 states have call successors, (19) [2025-03-17 11:52:10,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2025-03-17 11:52:10,109 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 112 transitions. Word has length 37 [2025-03-17 11:52:10,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:10,109 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 112 transitions. [2025-03-17 11:52:10,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 11:52:10,109 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2025-03-17 11:52:10,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 11:52:10,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:10,110 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:10,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 11:52:10,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:10,315 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting checkErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-17 11:52:10,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:10,315 INFO L85 PathProgramCache]: Analyzing trace with hash -15473078, now seen corresponding path program 1 times [2025-03-17 11:52:10,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:10,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401855537] [2025-03-17 11:52:10,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:10,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:10,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 11:52:10,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 11:52:10,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:10,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:10,450 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:52:10,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:10,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401855537] [2025-03-17 11:52:10,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401855537] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:10,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708500182] [2025-03-17 11:52:10,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:10,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:10,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:52:10,452 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:52:10,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 11:52:10,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 11:52:10,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 11:52:10,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:10,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:10,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 11:52:10,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:52:10,681 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:52:10,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:52:10,716 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 29 treesize of output 25 [2025-03-17 11:52:10,881 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:52:10,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708500182] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:52:10,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:52:10,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 20 [2025-03-17 11:52:10,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127418759] [2025-03-17 11:52:10,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:52:10,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 11:52:10,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:10,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 11:52:10,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2025-03-17 11:52:10,882 INFO L87 Difference]: Start difference. First operand 92 states and 112 transitions. Second operand has 21 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 10 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-17 11:52:11,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:11,212 INFO L93 Difference]: Finished difference Result 160 states and 203 transitions. [2025-03-17 11:52:11,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 11:52:11,216 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 10 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 7 states have call successors, (13) Word has length 37 [2025-03-17 11:52:11,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:11,217 INFO L225 Difference]: With dead ends: 160 [2025-03-17 11:52:11,217 INFO L226 Difference]: Without dead ends: 160 [2025-03-17 11:52:11,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2025-03-17 11:52:11,218 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 139 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:11,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 262 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:52:11,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-17 11:52:11,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 145. [2025-03-17 11:52:11,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 98 states have (on average 1.2142857142857142) internal successors, (119), 107 states have internal predecessors, (119), 33 states have call successors, (33), 10 states have call predecessors, (33), 10 states have return successors, (33), 27 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-17 11:52:11,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 185 transitions. [2025-03-17 11:52:11,227 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 185 transitions. Word has length 37 [2025-03-17 11:52:11,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:11,227 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 185 transitions. [2025-03-17 11:52:11,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 10 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-17 11:52:11,227 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 185 transitions. [2025-03-17 11:52:11,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 11:52:11,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:11,228 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:11,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 11:52:11,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-17 11:52:11,429 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-17 11:52:11,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:11,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1984726873, now seen corresponding path program 1 times [2025-03-17 11:52:11,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:11,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721984539] [2025-03-17 11:52:11,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:11,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:11,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 11:52:11,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 11:52:11,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:11,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:11,626 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 11:52:11,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:11,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721984539] [2025-03-17 11:52:11,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721984539] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:11,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991765891] [2025-03-17 11:52:11,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:11,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:11,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:52:11,641 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:52:11,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 11:52:11,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 11:52:11,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 11:52:11,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:11,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:11,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 11:52:11,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:52:11,920 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 11:52:11,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:52:12,104 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 30 treesize of output 26 [2025-03-17 11:52:12,201 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 11:52:12,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991765891] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:52:12,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:52:12,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 32 [2025-03-17 11:52:12,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765461857] [2025-03-17 11:52:12,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:52:12,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-17 11:52:12,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:12,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-17 11:52:12,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=939, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 11:52:12,204 INFO L87 Difference]: Start difference. First operand 145 states and 185 transitions. Second operand has 33 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 10 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2025-03-17 11:52:16,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 11:52:17,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:17,636 INFO L93 Difference]: Finished difference Result 271 states and 338 transitions. [2025-03-17 11:52:17,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-17 11:52:17,637 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 10 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) Word has length 39 [2025-03-17 11:52:17,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:17,638 INFO L225 Difference]: With dead ends: 271 [2025-03-17 11:52:17,638 INFO L226 Difference]: Without dead ends: 271 [2025-03-17 11:52:17,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=585, Invalid=3321, Unknown=0, NotChecked=0, Total=3906 [2025-03-17 11:52:17,641 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 236 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 69 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:17,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 634 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 841 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-03-17 11:52:17,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-17 11:52:17,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 187. [2025-03-17 11:52:17,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 133 states have (on average 1.1804511278195489) internal successors, (157), 141 states have internal predecessors, (157), 33 states have call successors, (33), 12 states have call predecessors, (33), 17 states have return successors, (45), 33 states have call predecessors, (45), 33 states have call successors, (45) [2025-03-17 11:52:17,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 235 transitions. [2025-03-17 11:52:17,649 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 235 transitions. Word has length 39 [2025-03-17 11:52:17,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:17,650 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 235 transitions. [2025-03-17 11:52:17,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 10 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2025-03-17 11:52:17,650 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 235 transitions. [2025-03-17 11:52:17,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 11:52:17,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:17,651 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:17,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 11:52:17,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:17,855 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-17 11:52:17,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:17,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1864153487, now seen corresponding path program 1 times [2025-03-17 11:52:17,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:17,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774942596] [2025-03-17 11:52:17,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:17,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:17,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 11:52:17,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 11:52:17,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:17,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:18,054 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 11:52:18,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:18,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774942596] [2025-03-17 11:52:18,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774942596] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:18,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256753850] [2025-03-17 11:52:18,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:18,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:18,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:52:18,056 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:52:18,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 11:52:18,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 11:52:18,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 11:52:18,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:18,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:18,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 11:52:18,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:52:18,144 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 7 treesize of output 6 [2025-03-17 11:52:18,345 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 29 treesize of output 23 [2025-03-17 11:52:18,426 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:52:18,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:52:22,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256753850] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:22,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:52:22,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 25 [2025-03-17 11:52:22,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385597655] [2025-03-17 11:52:22,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:52:22,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 11:52:22,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:22,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 11:52:22,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2025-03-17 11:52:22,541 INFO L87 Difference]: Start difference. First operand 187 states and 235 transitions. Second operand has 25 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 7 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-17 11:52:22,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:22,933 INFO L93 Difference]: Finished difference Result 189 states and 236 transitions. [2025-03-17 11:52:22,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 11:52:22,934 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 7 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 44 [2025-03-17 11:52:22,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:22,935 INFO L225 Difference]: With dead ends: 189 [2025-03-17 11:52:22,935 INFO L226 Difference]: Without dead ends: 189 [2025-03-17 11:52:22,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=177, Invalid=1463, Unknown=0, NotChecked=0, Total=1640 [2025-03-17 11:52:22,936 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 45 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:22,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 338 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:52:22,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-17 11:52:22,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2025-03-17 11:52:22,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 135 states have (on average 1.1703703703703703) internal successors, (158), 142 states have internal predecessors, (158), 33 states have call successors, (33), 13 states have call predecessors, (33), 18 states have return successors, (45), 33 states have call predecessors, (45), 33 states have call successors, (45) [2025-03-17 11:52:22,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 236 transitions. [2025-03-17 11:52:22,955 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 236 transitions. Word has length 44 [2025-03-17 11:52:22,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:22,955 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 236 transitions. [2025-03-17 11:52:22,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 7 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-17 11:52:22,956 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 236 transitions. [2025-03-17 11:52:22,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 11:52:22,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:22,957 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:22,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 11:52:23,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:23,157 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-17 11:52:23,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:23,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1307017806, now seen corresponding path program 1 times [2025-03-17 11:52:23,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:23,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377142812] [2025-03-17 11:52:23,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:23,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:23,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 11:52:23,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 11:52:23,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:23,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:23,572 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 11:52:23,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:23,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377142812] [2025-03-17 11:52:23,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377142812] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:23,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795762307] [2025-03-17 11:52:23,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:23,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:23,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:52:23,575 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:52:23,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 11:52:23,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 11:52:23,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 11:52:23,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:23,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:23,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 11:52:23,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:52:23,880 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 11:52:23,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:52:23,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-03-17 11:52:24,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:52:24,386 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 39 treesize of output 43 [2025-03-17 11:52:24,539 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 11:52:24,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795762307] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:52:24,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:52:24,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 38 [2025-03-17 11:52:24,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061203106] [2025-03-17 11:52:24,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:52:24,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-17 11:52:24,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:24,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-17 11:52:24,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1362, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 11:52:24,541 INFO L87 Difference]: Start difference. First operand 189 states and 236 transitions. Second operand has 39 states, 32 states have (on average 2.21875) internal successors, (71), 33 states have internal predecessors, (71), 13 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-17 11:52:27,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:27,119 INFO L93 Difference]: Finished difference Result 420 states and 537 transitions. [2025-03-17 11:52:27,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-03-17 11:52:27,119 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 32 states have (on average 2.21875) internal successors, (71), 33 states have internal predecessors, (71), 13 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) Word has length 52 [2025-03-17 11:52:27,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:27,121 INFO L225 Difference]: With dead ends: 420 [2025-03-17 11:52:27,121 INFO L226 Difference]: Without dead ends: 395 [2025-03-17 11:52:27,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=703, Invalid=6269, Unknown=0, NotChecked=0, Total=6972 [2025-03-17 11:52:27,123 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 250 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 1408 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 1565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:27,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 761 Invalid, 1565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1408 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 11:52:27,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-03-17 11:52:27,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 256. [2025-03-17 11:52:27,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 193 states have (on average 1.1709844559585492) internal successors, (226), 193 states have internal predecessors, (226), 38 states have call successors, (38), 13 states have call predecessors, (38), 22 states have return successors, (61), 49 states have call predecessors, (61), 38 states have call successors, (61) [2025-03-17 11:52:27,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 325 transitions. [2025-03-17 11:52:27,138 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 325 transitions. Word has length 52 [2025-03-17 11:52:27,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:27,138 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 325 transitions. [2025-03-17 11:52:27,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 32 states have (on average 2.21875) internal successors, (71), 33 states have internal predecessors, (71), 13 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-17 11:52:27,139 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 325 transitions. [2025-03-17 11:52:27,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 11:52:27,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:27,139 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:27,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 11:52:27,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 11:52:27,340 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-17 11:52:27,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:27,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1743185009, now seen corresponding path program 1 times [2025-03-17 11:52:27,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:27,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041919964] [2025-03-17 11:52:27,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:27,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:27,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 11:52:27,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 11:52:27,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:27,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:27,469 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 11:52:27,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:27,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041919964] [2025-03-17 11:52:27,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041919964] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:27,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361087878] [2025-03-17 11:52:27,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:27,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:27,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:52:27,471 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:52:27,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 11:52:27,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 11:52:27,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 11:52:27,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:27,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:27,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 11:52:27,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:52:27,727 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 11:52:27,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:52:27,752 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 29 treesize of output 25 [2025-03-17 11:52:28,269 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 11:52:28,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361087878] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:52:28,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:52:28,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 30 [2025-03-17 11:52:28,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69022175] [2025-03-17 11:52:28,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:52:28,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-17 11:52:28,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:28,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 11:52:28,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2025-03-17 11:52:28,271 INFO L87 Difference]: Start difference. First operand 256 states and 325 transitions. Second operand has 30 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (17), 13 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-17 11:52:28,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:28,929 INFO L93 Difference]: Finished difference Result 434 states and 566 transitions. [2025-03-17 11:52:28,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 11:52:28,930 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (17), 13 states have call predecessors, (17), 11 states have call successors, (17) Word has length 52 [2025-03-17 11:52:28,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:28,932 INFO L225 Difference]: With dead ends: 434 [2025-03-17 11:52:28,932 INFO L226 Difference]: Without dead ends: 415 [2025-03-17 11:52:28,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=267, Invalid=1895, Unknown=0, NotChecked=0, Total=2162 [2025-03-17 11:52:28,933 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 46 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:28,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 501 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:52:28,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-17 11:52:28,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 173. [2025-03-17 11:52:28,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 123 states have (on average 1.170731707317073) internal successors, (144), 129 states have internal predecessors, (144), 32 states have call successors, (32), 13 states have call predecessors, (32), 16 states have return successors, (41), 30 states have call predecessors, (41), 31 states have call successors, (41) [2025-03-17 11:52:28,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 217 transitions. [2025-03-17 11:52:28,941 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 217 transitions. Word has length 52 [2025-03-17 11:52:28,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:28,942 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 217 transitions. [2025-03-17 11:52:28,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (17), 13 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-17 11:52:28,942 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 217 transitions. [2025-03-17 11:52:28,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-17 11:52:28,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:28,942 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:28,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 11:52:29,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 11:52:29,143 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting checkErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-17 11:52:29,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:29,143 INFO L85 PathProgramCache]: Analyzing trace with hash -3748698, now seen corresponding path program 1 times [2025-03-17 11:52:29,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:29,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971844095] [2025-03-17 11:52:29,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:29,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:29,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 11:52:29,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 11:52:29,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:29,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:29,243 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-17 11:52:29,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:29,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971844095] [2025-03-17 11:52:29,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971844095] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:29,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254181363] [2025-03-17 11:52:29,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:29,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:29,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:52:29,245 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:52:29,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 11:52:29,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 11:52:29,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 11:52:29,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:29,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:29,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 11:52:29,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:52:29,587 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 11:52:29,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:52:29,742 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 35 treesize of output 31 [2025-03-17 11:52:29,907 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 11:52:29,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254181363] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:52:29,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:52:29,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 11] total 27 [2025-03-17 11:52:29,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972846927] [2025-03-17 11:52:29,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:52:29,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-17 11:52:29,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:29,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-17 11:52:29,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2025-03-17 11:52:29,913 INFO L87 Difference]: Start difference. First operand 173 states and 217 transitions. Second operand has 27 states, 25 states have (on average 2.76) internal successors, (69), 22 states have internal predecessors, (69), 12 states have call successors, (23), 8 states have call predecessors, (23), 4 states have return successors, (17), 11 states have call predecessors, (17), 9 states have call successors, (17) [2025-03-17 11:52:33,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 11:52:34,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:34,480 INFO L93 Difference]: Finished difference Result 160 states and 190 transitions. [2025-03-17 11:52:34,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 11:52:34,481 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.76) internal successors, (69), 22 states have internal predecessors, (69), 12 states have call successors, (23), 8 states have call predecessors, (23), 4 states have return successors, (17), 11 states have call predecessors, (17), 9 states have call successors, (17) Word has length 54 [2025-03-17 11:52:34,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:34,481 INFO L225 Difference]: With dead ends: 160 [2025-03-17 11:52:34,481 INFO L226 Difference]: Without dead ends: 160 [2025-03-17 11:52:34,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 87 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=285, Invalid=1607, Unknown=0, NotChecked=0, Total=1892 [2025-03-17 11:52:34,482 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 185 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 52 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:34,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 416 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 510 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-17 11:52:34,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-17 11:52:34,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 142. [2025-03-17 11:52:34,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 102 states have (on average 1.107843137254902) internal successors, (113), 105 states have internal predecessors, (113), 26 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (33), 25 states have call predecessors, (33), 25 states have call successors, (33) [2025-03-17 11:52:34,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 172 transitions. [2025-03-17 11:52:34,489 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 172 transitions. Word has length 54 [2025-03-17 11:52:34,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:34,489 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 172 transitions. [2025-03-17 11:52:34,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.76) internal successors, (69), 22 states have internal predecessors, (69), 12 states have call successors, (23), 8 states have call predecessors, (23), 4 states have return successors, (17), 11 states have call predecessors, (17), 9 states have call successors, (17) [2025-03-17 11:52:34,489 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 172 transitions. [2025-03-17 11:52:34,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 11:52:34,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:34,491 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:34,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 11:52:34,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 11:52:34,695 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-17 11:52:34,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:34,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1511307547, now seen corresponding path program 1 times [2025-03-17 11:52:34,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:34,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683773340] [2025-03-17 11:52:34,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:34,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:34,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 11:52:34,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 11:52:34,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:34,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:34,967 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-17 11:52:34,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:34,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683773340] [2025-03-17 11:52:34,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683773340] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:34,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214577212] [2025-03-17 11:52:34,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:34,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:34,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:52:34,969 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:52:34,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 11:52:35,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 11:52:35,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 11:52:35,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:35,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:35,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 11:52:35,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:52:35,241 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-17 11:52:35,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:52:35,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214577212] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:35,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:52:35,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2025-03-17 11:52:35,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188080287] [2025-03-17 11:52:35,474 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:52:35,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 11:52:35,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:35,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 11:52:35,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2025-03-17 11:52:35,475 INFO L87 Difference]: Start difference. First operand 142 states and 172 transitions. Second operand has 24 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 19 states have internal predecessors, (46), 10 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-17 11:52:36,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:36,446 INFO L93 Difference]: Finished difference Result 292 states and 363 transitions. [2025-03-17 11:52:36,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-17 11:52:36,446 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 19 states have internal predecessors, (46), 10 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 69 [2025-03-17 11:52:36,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:36,447 INFO L225 Difference]: With dead ends: 292 [2025-03-17 11:52:36,448 INFO L226 Difference]: Without dead ends: 240 [2025-03-17 11:52:36,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=414, Invalid=2778, Unknown=0, NotChecked=0, Total=3192 [2025-03-17 11:52:36,449 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 188 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:36,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 616 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:52:36,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-17 11:52:36,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 164. [2025-03-17 11:52:36,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 122 states have (on average 1.098360655737705) internal successors, (134), 121 states have internal predecessors, (134), 28 states have call successors, (28), 11 states have call predecessors, (28), 13 states have return successors, (37), 31 states have call predecessors, (37), 27 states have call successors, (37) [2025-03-17 11:52:36,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 199 transitions. [2025-03-17 11:52:36,455 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 199 transitions. Word has length 69 [2025-03-17 11:52:36,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:36,455 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 199 transitions. [2025-03-17 11:52:36,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 19 states have internal predecessors, (46), 10 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-17 11:52:36,455 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 199 transitions. [2025-03-17 11:52:36,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 11:52:36,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:36,456 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:36,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-17 11:52:36,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:36,660 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-17 11:52:36,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:36,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1538895268, now seen corresponding path program 1 times [2025-03-17 11:52:36,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:36,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465739840] [2025-03-17 11:52:36,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:36,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:36,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 11:52:36,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 11:52:36,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:36,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:36,821 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-17 11:52:36,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:36,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465739840] [2025-03-17 11:52:36,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465739840] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:36,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790618331] [2025-03-17 11:52:36,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:36,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:36,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:52:36,823 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:52:36,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 11:52:36,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 11:52:36,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 11:52:36,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:36,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:36,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 11:52:36,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:52:37,170 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-17 11:52:37,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:52:37,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790618331] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:37,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:52:37,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 24 [2025-03-17 11:52:37,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036264641] [2025-03-17 11:52:37,439 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:52:37,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 11:52:37,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:37,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 11:52:37,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2025-03-17 11:52:37,440 INFO L87 Difference]: Start difference. First operand 164 states and 199 transitions. Second operand has 24 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 20 states have internal predecessors, (62), 11 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (16), 11 states have call predecessors, (16), 9 states have call successors, (16) [2025-03-17 11:52:37,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:37,675 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2025-03-17 11:52:37,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:52:37,675 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 20 states have internal predecessors, (62), 11 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (16), 11 states have call predecessors, (16), 9 states have call successors, (16) Word has length 69 [2025-03-17 11:52:37,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:37,675 INFO L225 Difference]: With dead ends: 53 [2025-03-17 11:52:37,675 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 11:52:37,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=1120, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 11:52:37,676 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 24 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:37,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 299 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:52:37,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 11:52:37,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 11:52:37,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:52:37,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 11:52:37,676 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2025-03-17 11:52:37,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:37,676 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 11:52:37,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 20 states have internal predecessors, (62), 11 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (16), 11 states have call predecessors, (16), 9 states have call successors, (16) [2025-03-17 11:52:37,677 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 11:52:37,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 11:52:37,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (16 of 17 remaining) [2025-03-17 11:52:37,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (15 of 17 remaining) [2025-03-17 11:52:37,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (14 of 17 remaining) [2025-03-17 11:52:37,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (13 of 17 remaining) [2025-03-17 11:52:37,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 17 remaining) [2025-03-17 11:52:37,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 17 remaining) [2025-03-17 11:52:37,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 17 remaining) [2025-03-17 11:52:37,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 17 remaining) [2025-03-17 11:52:37,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 17 remaining) [2025-03-17 11:52:37,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 17 remaining) [2025-03-17 11:52:37,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 17 remaining) [2025-03-17 11:52:37,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 17 remaining) [2025-03-17 11:52:37,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 17 remaining) [2025-03-17 11:52:37,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 17 remaining) [2025-03-17 11:52:37,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 17 remaining) [2025-03-17 11:52:37,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 17 remaining) [2025-03-17 11:52:37,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 17 remaining) [2025-03-17 11:52:37,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-17 11:52:37,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:37,882 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:37,883 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:52:37,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:52:37 BoogieIcfgContainer [2025-03-17 11:52:37,885 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:52:37,885 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:52:37,885 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:52:37,885 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:52:37,886 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:52:03" (3/4) ... [2025-03-17 11:52:37,887 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 11:52:37,891 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 11:52:37,891 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure check [2025-03-17 11:52:37,891 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-17 11:52:37,894 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-03-17 11:52:37,894 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-17 11:52:37,894 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 11:52:37,895 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 11:52:37,948 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:52:37,949 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:52:37,949 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:52:37,950 INFO L158 Benchmark]: Toolchain (without parser) took 35394.08ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 113.4MB in the beginning and 125.8MB in the end (delta: -12.4MB). Peak memory consumption was 63.8MB. Max. memory is 16.1GB. [2025-03-17 11:52:37,950 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:52:37,951 INFO L158 Benchmark]: CACSL2BoogieTranslator took 140.78ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 102.1MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:52:37,951 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.89ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 100.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:52:37,952 INFO L158 Benchmark]: Boogie Preprocessor took 21.28ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:52:37,952 INFO L158 Benchmark]: IcfgBuilder took 327.48ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 82.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:52:37,952 INFO L158 Benchmark]: TraceAbstraction took 34811.37ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 81.9MB in the beginning and 131.4MB in the end (delta: -49.5MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2025-03-17 11:52:37,952 INFO L158 Benchmark]: Witness Printer took 63.71ms. Allocated memory is still 218.1MB. Free memory was 131.4MB in the beginning and 125.8MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:52:37,953 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 140.78ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 102.1MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.89ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 100.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.28ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 327.48ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 82.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 34811.37ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 81.9MB in the beginning and 131.4MB in the end (delta: -49.5MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * Witness Printer took 63.71ms. Allocated memory is still 218.1MB. Free memory was 131.4MB in the beginning and 125.8MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 40]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 52]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 52]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 52]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 5]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 62 locations, 78 edges, 17 error locations. Started 1 CEGAR loops. OverallTime: 34.8s, OverallIterations: 20, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 1792 SdHoareTripleChecker+Valid, 12.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1754 mSDsluCounter, 6682 SdHoareTripleChecker+Invalid, 11.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5800 mSDsCounter, 634 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7015 IncrementalHoareTripleChecker+Invalid, 7651 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 634 mSolverCounterUnsat, 882 mSDtfsCounter, 7015 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1219 GetRequests, 683 SyntacticMatches, 18 SemanticMatches, 518 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4751 ImplicationChecksByTransitivity, 13.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=256occurred in iteration=16, InterpolantAutomatonStates: 311, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 710 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 13.1s InterpolantComputationTime, 1259 NumberOfCodeBlocks, 1259 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1511 ConstructedInterpolants, 62 QuantifiedInterpolants, 9806 SizeOfPredicates, 84 NumberOfNonLiveVariables, 2162 ConjunctsInSsa, 295 ConjunctsInUnsatCore, 39 InterpolantComputations, 10 PerfectInterpolantSequences, 572/733 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 11:52:37,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE